{"id":"https://openalex.org/W2003554808","doi":"https://doi.org/10.1080/10637199808947367","title":"A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS - I CHOLESKY FACTORIZATION","display_name":"A LINEAR ARRAY FOR LARGE SPARSE MATRIX OPERATIONS - I CHOLESKY FACTORIZATION","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2003554808","doi":"https://doi.org/10.1080/10637199808947367","mag":"2003554808"},"language":"en","primary_location":{"id":"doi:10.1080/10637199808947367","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199808947367","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","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/A5005292649","display_name":"M.V. PADMINI","orcid":null},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"M.V. PADMINI","raw_affiliation_strings":["\n                   \n               Department of Computer Science and Engineering, Indian Institute of Technology Delhi, New Delhi, 10016, India","Department of Computer Science and Engineering , Indian Institute of Technology Delhi , New Delhi, 10016, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\n                   \n               Department of Computer Science and Engineering, Indian Institute of Technology Delhi, New Delhi, 10016, India","institution_ids":["https://openalex.org/I68891433"]},{"raw_affiliation_string":"Department of Computer Science and Engineering , Indian Institute of Technology Delhi , New Delhi, 10016, India","institution_ids":["https://openalex.org/I68891433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109226356","display_name":"Bharat B. Madan","orcid":null},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"B.B. MADAN","raw_affiliation_strings":["\n                   \n               Department of Computer Science and Engineering, Indian Institute of Technology Delhi, New Delhi, 10016, India","Department of Computer Science and Engineering , Indian Institute of Technology Delhi , New Delhi, 10016, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\n                   \n               Department of Computer Science and Engineering, Indian Institute of Technology Delhi, New Delhi, 10016, India","institution_ids":["https://openalex.org/I68891433"]},{"raw_affiliation_string":"Department of Computer Science and Engineering , Indian Institute of Technology Delhi , New Delhi, 10016, India","institution_ids":["https://openalex.org/I68891433"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024433827","display_name":"B.N. Jain","orcid":"https://orcid.org/0009-0006-4436-6874"},"institutions":[{"id":"https://openalex.org/I68891433","display_name":"Indian Institute of Technology Delhi","ror":"https://ror.org/049tgcd06","country_code":"IN","type":"education","lineage":["https://openalex.org/I68891433"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"B.N. JAIN","raw_affiliation_strings":["\n                   \n               Department of Computer Science and Engineering, Indian Institute of Technology Delhi, New Delhi, 10016, India","Department of Computer Science and Engineering , Indian Institute of Technology Delhi , New Delhi, 10016, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\n                   \n               Department of Computer Science and Engineering, Indian Institute of Technology Delhi, New Delhi, 10016, India","institution_ids":["https://openalex.org/I68891433"]},{"raw_affiliation_string":"Department of Computer Science and Engineering , Indian Institute of Technology Delhi , New Delhi, 10016, India","institution_ids":["https://openalex.org/I68891433"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4041,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.71777476,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"13","issue":"3","first_page":"187","last_page":"215"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11797","display_name":"graph theory and CDMA systems","score":0.9897000193595886,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9868000149726868,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cholesky-decomposition","display_name":"Cholesky decomposition","score":0.9491632580757141},{"id":"https://openalex.org/keywords/incomplete-cholesky-factorization","display_name":"Incomplete Cholesky factorization","score":0.815625786781311},{"id":"https://openalex.org/keywords/minimum-degree-algorithm","display_name":"Minimum degree algorithm","score":0.660488486289978},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.5568844079971313},{"id":"https://openalex.org/keywords/incomplete-lu-factorization","display_name":"Incomplete LU factorization","score":0.5371224880218506},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5145391821861267},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.48290467262268066},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.4650821089744568},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.4401968717575073},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36315733194351196},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35679566860198975},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.15718600153923035},{"id":"https://openalex.org/keywords/chemistry","display_name":"Chemistry","score":0.12659144401550293},{"id":"https://openalex.org/keywords/chromatography","display_name":"Chromatography","score":0.09440428018569946},{"id":"https://openalex.org/keywords/computational-chemistry","display_name":"Computational chemistry","score":0.06775715947151184}],"concepts":[{"id":"https://openalex.org/C34727166","wikidata":"https://www.wikidata.org/wiki/Q515375","display_name":"Cholesky decomposition","level":3,"score":0.9491632580757141},{"id":"https://openalex.org/C44363057","wikidata":"https://www.wikidata.org/wiki/Q6015160","display_name":"Incomplete Cholesky factorization","level":4,"score":0.815625786781311},{"id":"https://openalex.org/C46085209","wikidata":"https://www.wikidata.org/wiki/Q17098969","display_name":"Minimum degree algorithm","level":5,"score":0.660488486289978},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.5568844079971313},{"id":"https://openalex.org/C134978465","wikidata":"https://www.wikidata.org/wiki/Q1654069","display_name":"Incomplete LU factorization","level":4,"score":0.5371224880218506},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5145391821861267},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.48290467262268066},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.4650821089744568},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.4401968717575073},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36315733194351196},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35679566860198975},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.15718600153923035},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.12659144401550293},{"id":"https://openalex.org/C43617362","wikidata":"https://www.wikidata.org/wiki/Q170050","display_name":"Chromatography","level":1,"score":0.09440428018569946},{"id":"https://openalex.org/C147597530","wikidata":"https://www.wikidata.org/wiki/Q369472","display_name":"Computational chemistry","level":1,"score":0.06775715947151184},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10637199808947367","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199808947367","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4099999964237213,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W190241823","https://openalex.org/W1524586108","https://openalex.org/W1968235986","https://openalex.org/W1981885118","https://openalex.org/W1993274656","https://openalex.org/W2045325210","https://openalex.org/W2075085406","https://openalex.org/W2088501249","https://openalex.org/W2089898547","https://openalex.org/W2147542748","https://openalex.org/W2752093666"],"related_works":["https://openalex.org/W2381435995","https://openalex.org/W2078637543","https://openalex.org/W3022256543","https://openalex.org/W898189783","https://openalex.org/W1987177655","https://openalex.org/W1509943448","https://openalex.org/W2526784484","https://openalex.org/W2050448951","https://openalex.org/W4246966070","https://openalex.org/W2127144731"],"abstract_inverted_index":{"Abstract":[0],"Achieving":[1],"efficiency":[2],"in":[3,20],"parallel":[4,103],"sparse":[5],"sub-matrix":[6,45],"Cholesky":[7,46,106],"factorization":[8],"is":[9,24,35,51,68],"known":[10],"to":[11,37,44,81],"be":[12],"difficult.":[13],"The":[14,31,48,64],"relevance":[15],"of":[16,71,96],"the":[17,28,39,54,60,85,94,97],"underlying":[18,98],"architecture":[19,34,99],"obtaining":[21],"good":[22],"performance":[23],"demonstrated,":[25],"by":[26],"choosing":[27],"linear":[29,32,49,78],"array.":[30],"array":[33,50,70],"chosen":[36],"suit":[38],"data":[40,65],"flow":[41],"pattern":[42],"inherent":[43],"scheme.":[47],"synthesized":[52],"on":[53],"reconfigurable":[55],"transputer":[56],"based":[57],"PARAM":[58],"(and":[59],"MEIKO":[61],"CSN)":[62],"machine.":[63],"structure":[66],"used":[67],"an":[69,101],"linked":[72],"lists.":[73],"Results":[74],"obtained":[75],"indicate":[76],"almost":[77],"speed-up":[79],"up":[80],"64":[82],"processors":[83,91],"though":[84],"tests":[86],"were":[87],"conducted":[88],"for":[89,100],"128":[90],"This":[92],"highlights":[93],"significance":[95],"efficient":[102],"implementation.":[104],"Keywords:":[105],"factorizationLinear":[107],"arrayParallel":[108],"solutionSparse":[109],"matrix":[110],"Notes":[111],"*":[112],"Corresponding":[113],"author.":[114]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}