{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001118181,0.0005639892,0.0006745998,0.0005482823,0.0004207887,0.0001586053,0.003110289,0.0003604234,0.000136776],"category_scores_gemma":[0.0003541851,0.0004284765,0.0003934217,0.001107614,0.0008175631,0.0002807027,0.001221316,0.0007654459,0.00002907729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002202503,"about_ca_system_score_gemma":0.0004519443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006368326,"about_ca_topic_score_gemma":0.00004879801,"domain_scores_codex":[0.9964126,0.0008080264,0.000494319,0.00094235,0.00082043,0.0005222157],"domain_scores_gemma":[0.9948208,0.001079978,0.0007287706,0.002619884,0.0005684317,0.0001821695],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001748288,0.001501172,0.000191095,0.000650658,0.0005388033,0.00008115646,0.006010134,0.1210416,0.002493979,0.8354738,0.01326587,0.01700341],"study_design_scores_gemma":[0.00154322,0.002133068,0.002500423,0.002307747,0.0003300219,0.000008406028,0.0003982692,0.8643395,0.03302221,0.05829484,0.0330799,0.002042399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03179489,0.0000224411,0.9544026,0.005480892,0.00075853,0.001938762,0.0004068919,0.0003534654,0.004841576],"genre_scores_gemma":[0.8172689,0.00009804319,0.1798954,0.001441849,0.0002391876,0.00004590311,0.0001201494,0.00007684834,0.0008136979],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.785474,"threshold_uncertainty_score":0.9998167,"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."}}