{"doi":"10.1137/0908053","title":"An Adaptive General Sparse Out-Of-Core Cholesky Factorization Scheme","abstract":null,"journal":"SIAM Journal on Scientific and Statistical Computing","year":1987,"id":29140,"datarank":1.312271945472986,"base_score":2.772588722239781,"endowment":2.772588722239781,"self_citation_contribution":0.41588830833596724,"citation_network_contribution":0.896383637137019,"self_endowment_contribution":0.41588830833596724,"citer_contribution":0.896383637137019,"corpus_percentile":null,"corpus_rank":null,"citation_count":15,"citer_count":12,"citers_with_citation_signal":10,"citers_with_endowment":10,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":161401,"name":"Joseph W. H. Liu","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":2.772588722239781,"endowment":2.772588722239781,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"24523987","pmcid":null,"openalex_id":"https://openalex.org/W1987177655","authors":[],"funders":[],"total_grants":0,"fwci":3.0942,"citation_percentile":0.90818088,"influential_citations":4,"citation_trend":[{"year":2016,"count":1},{"year":2017,"count":1},{"year":2019,"count":1}],"oa_status":"closed","license":null,"oa_locations":[{"url":"http://epubs.siam.org/doi/pdf/10.1137/0908053","host_type":"publisher"},{"url":"https://doi.org/10.1137/0908053","host_type":"journal"}],"fields_of_study":["Matrix Theory and Algorithms","Tensor decomposition and applications","Interconnection Networks and Systems","Mathematics","Computer Science"],"mesh_terms":[],"keywords":["Cholesky decomposition","Incomplete Cholesky factorization","Incomplete LU factorization","Minimum degree algorithm","Factorization","Sparse matrix","Computer science","Scheme (mathematics)","Matrix decomposition","Matrix (chemical analysis)","Extension (predicate logic)","Reduction (mathematics)","Mathematics","Algorithm","Computational chemistry"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-08T22:43:04.315185Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}