{"id":"W2914308990","doi":"","title":"On the use of low-rank arithmetic to reduce the complexity of parallel sparse linear solvers based on direct factorization techniques","year":2018,"lang":"en","type":"preprint","venue":"Oskar-Bordeaux (Universite de Bordeaux)","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Preconditioner; Solver; Computer science; Memory footprint; Linear system; Block (permutation group theory); Sparse matrix; Rank (graph theory); Matrix-free methods; Incomplete LU factorization; Parallel computing; Kernel (algebra); Granularity; Algorithm; Theoretical computer science; Iterative method; Matrix decomposition; Mathematics; Eigenvalues and eigenvectors","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006220215,0.0008565529,0.0006199377,0.0007051872,0.0004698873,0.001117274,0.0008514114,0.0005915386,0.005033472],"category_scores_gemma":[0.003313131,0.0003238796,0.0005567255,0.0007734682,0.0007059762,0.001576087,0.001080224,0.001077428,0.001852978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003742233,"about_ca_system_score_gemma":0.001222477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003094984,"about_ca_topic_score_gemma":0.005441713,"domain_scores_codex":[0.9993241,0.00012456,0.00003154424,0.00006762299,0.0003648778,0.00008729151],"domain_scores_gemma":[0.9986494,0.0006094926,0.0001029293,0.000277605,0.0003148801,0.00004560722],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007404607,0.0002694016,0.001354157,0.0008224039,0.0001069273,0.0004237963,0.0004154111,0.2070875,0.07664655,0.06127791,0.01290068,0.6379548],"study_design_scores_gemma":[0.0000993501,0.0004205001,0.0004901342,0.00008829852,0.00004685114,0.0002888248,0.00008586301,0.9219123,0.04087586,0.0144793,0.02116708,0.00004568202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0467227,0.002954777,0.9296737,0.0007619284,0.0001890932,0.0001217055,0.000117905,0.002940289,0.01651793],"genre_scores_gemma":[0.3071073,0.003834306,0.6739354,0.0004517008,0.0002373199,0.0002032453,0.000485398,0.0005441965,0.01320123],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005033472,"threshold_uncertainty_score":0.01683861,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0558826148687074,"score_gpt":0.2713000959371185,"score_spread":0.215417481068411,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}