{"id":"W2128985516","doi":"10.1002/nla.1826","title":"Finding off‐diagonal entries of the inverse of a large symmetric sparse matrix","year":2012,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Diagonal; Inverse; Mathematics; Diagonal matrix; Node (physics); Matrix (chemical analysis); Combinatorics; Vertex (graph theory); Algorithm; Block matrix; Band matrix; Square matrix; Symmetric matrix; Eigenvalues and eigenvectors; Geometry; Graph","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004908455,0.0004916487,0.0004534467,0.0006601863,0.0003286682,0.0005234308,0.0005420904,0.0003389753,0.002859745],"category_scores_gemma":[0.00272875,0.0002705351,0.0005069437,0.0003065238,0.0007134805,0.0008513611,0.0008608158,0.0006717246,0.0006689592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003030661,"about_ca_system_score_gemma":0.0006427492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001369936,"about_ca_topic_score_gemma":0.002033343,"domain_scores_codex":[0.9997074,0.00005911534,0.00001581419,0.00004301615,0.0001441836,0.00003044048],"domain_scores_gemma":[0.9990595,0.0004561964,0.0001091366,0.0001188077,0.0002042759,0.00005220555],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003519856,0.0001462581,0.003749196,0.0003627618,0.00006825108,0.0006997627,0.0006414152,0.4026173,0.1293945,0.1543752,0.006252195,0.3013411],"study_design_scores_gemma":[0.00002055013,0.0000766899,0.0004416083,0.00001379211,0.000007068263,0.0001693508,0.00006628779,0.9455926,0.01870918,0.03191042,0.002975772,0.00001658951],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03190982,0.00002955499,0.9658684,0.00006782613,0.00002065403,0.00002760058,0.00003127579,0.0002807337,0.001764108],"genre_scores_gemma":[0.3289505,0.00006960615,0.6674333,0.00005424879,0.00002371677,0.0000545382,0.000171366,0.0001389923,0.003103709],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002859745,"threshold_uncertainty_score":0.009566784,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01242476064321722,"score_gpt":0.2608739387652651,"score_spread":0.2484491781220479,"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."}}