{"id":"https://openalex.org/W1966219902","doi":"https://doi.org/10.1080/00207169108803957","title":"A new bordering strategy for solving block-tridiagonal linear systems","display_name":"A new bordering strategy for solving block-tridiagonal linear systems","publication_year":1991,"publication_date":"1991-01-01","ids":{"openalex":"https://openalex.org/W1966219902","doi":"https://doi.org/10.1080/00207169108803957","mag":"1966219902"},"language":"en","primary_location":{"id":"doi:10.1080/00207169108803957","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169108803957","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050075410","display_name":"David Evans","orcid":"https://orcid.org/0009-0002-2834-6700"},"institutions":[{"id":"https://openalex.org/I143804889","display_name":"Loughborough University","ror":"https://ror.org/04vg4w365","country_code":"GB","type":"education","lineage":["https://openalex.org/I143804889"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"D. J. Evans","raw_affiliation_strings":["\n                   \n               Parallel Algorithm Research Centre, Department of Computer Studies, University of Technology, Loughborough, Leicestershire, UK","Parallel Algorithm Research Centre, Department of Computer Studies , University of Technology , Loughborough, Leicestershire, UK"],"affiliations":[{"raw_affiliation_string":"\n                   \n               Parallel Algorithm Research Centre, Department of Computer Studies, University of Technology, Loughborough, Leicestershire, UK","institution_ids":["https://openalex.org/I143804889"]},{"raw_affiliation_string":"Parallel Algorithm Research Centre, Department of Computer Studies , University of Technology , Loughborough, Leicestershire, UK","institution_ids":["https://openalex.org/I143804889"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109944362","display_name":"Martin D. Levin","orcid":null},"institutions":[{"id":"https://openalex.org/I143804889","display_name":"Loughborough University","ror":"https://ror.org/04vg4w365","country_code":"GB","type":"education","lineage":["https://openalex.org/I143804889"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"M. D. Levin","raw_affiliation_strings":["\n                   \n               Parallel Algorithm Research Centre, Department of Computer Studies, University of Technology, Loughborough, Leicestershire, UK","Parallel Algorithm Research Centre, Department of Computer Studies , University of Technology , Loughborough, Leicestershire, UK"],"affiliations":[{"raw_affiliation_string":"\n                   \n               Parallel Algorithm Research Centre, Department of Computer Studies, University of Technology, Loughborough, Leicestershire, UK","institution_ids":["https://openalex.org/I143804889"]},{"raw_affiliation_string":"Parallel Algorithm Research Centre, Department of Computer Studies , University of Technology , Loughborough, Leicestershire, UK","institution_ids":["https://openalex.org/I143804889"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050075410"],"corresponding_institution_ids":["https://openalex.org/I143804889"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0859025,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"38","issue":"1-2","first_page":"49","last_page":"60"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11435","display_name":"Polynomial and algebraic computation","score":0.9599999785423279,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9527999758720398,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/tridiagonal-matrix","display_name":"Tridiagonal matrix","score":0.7771758437156677},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7662346959114075},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.6086133718490601},{"id":"https://openalex.org/keywords/linear-system","display_name":"Linear system","score":0.4991607666015625},{"id":"https://openalex.org/keywords/tridiagonal-matrix-algorithm","display_name":"Tridiagonal matrix algorithm","score":0.4917934238910675},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.447308212518692},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36550357937812805},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3646213412284851},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32864266633987427},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2504989802837372},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.2411295473575592},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.21033957600593567},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.19499611854553223}],"concepts":[{"id":"https://openalex.org/C51647924","wikidata":"https://www.wikidata.org/wiki/Q1755277","display_name":"Tridiagonal matrix","level":3,"score":0.7771758437156677},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7662346959114075},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.6086133718490601},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.4991607666015625},{"id":"https://openalex.org/C176603272","wikidata":"https://www.wikidata.org/wiki/Q1819156","display_name":"Tridiagonal matrix algorithm","level":4,"score":0.4917934238910675},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.447308212518692},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36550357937812805},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3646213412284851},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32864266633987427},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2504989802837372},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.2411295473575592},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.21033957600593567},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.19499611854553223},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207169108803957","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207169108803957","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W798592269","https://openalex.org/W2062472350","https://openalex.org/W4238784554"],"related_works":["https://openalex.org/W2157863322","https://openalex.org/W2360550119","https://openalex.org/W2001381587","https://openalex.org/W2057923237","https://openalex.org/W4212973497","https://openalex.org/W1980786482","https://openalex.org/W1606194289","https://openalex.org/W4289860553","https://openalex.org/W3000091026","https://openalex.org/W2031726779"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"new":[2],"algorithm,":[3,6],"the":[4,8,26,34,37],"double-bordering":[5],"for":[7],"solution":[9,38],"of":[10,13,28,33,39],"linear":[11],"systems":[12,41],"equations":[14],"is":[15,20,42],"derived,":[16],"and":[17],"its":[18],"complexity":[19,27],"shown":[21],"to":[22,36],"be":[23],"compatible":[24],"with":[25],"Gaussian":[29],"elimination,":[30],"The":[31],"application":[32],"algorithm":[35],"block-tridiagonal":[40],"also":[43],"described.":[44],"Keywords:":[45],"Double":[46],"borderingblock-tridiagonal":[47],"systemsalgorithmic":[48],"representation":[49]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}