{"id":"W2750597507","doi":"10.1016/j.cam.2017.08.008","title":"Efficient computation of tridiagonal matrices largest eigenvalue","year":2017,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tridiagonal matrix; Mathematics; Computation; Eigenvalues and eigenvectors; Tridiagonal matrix algorithm; Sparse matrix; Matrix (chemical analysis); Applied mathematics; Algorithm; Eigenvalue algorithm; Divide-and-conquer eigenvalue algorithm; Power iteration; Numerical analysis; Numerical linear algebra; Band matrix; Square matrix; Symmetric matrix; Mathematical analysis; Iterative method","routes":{"ca_aff":true,"ca_fund":true,"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.0006493404,0.000987638,0.0009843858,0.001240263,0.0009950148,0.001667663,0.001181345,0.0009191603,0.0111967],"category_scores_gemma":[0.006710868,0.0004238302,0.0006062727,0.001336142,0.000535621,0.001676944,0.001501769,0.001232813,0.003583483],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005140775,"about_ca_system_score_gemma":0.001859387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002477747,"about_ca_topic_score_gemma":0.006665328,"domain_scores_codex":[0.9994198,0.000150543,0.00003788423,0.0000813632,0.0002231052,0.00008723405],"domain_scores_gemma":[0.9972042,0.001258532,0.0001346252,0.0004689292,0.0007793786,0.0001543133],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001035557,0.0004721443,0.002607184,0.0007829668,0.0002502155,0.0007818575,0.0007435307,0.2316616,0.04467212,0.1141837,0.04600001,0.5568091],"study_design_scores_gemma":[0.00007779989,0.00007326761,0.0004615599,0.00002380101,0.0000209567,0.0001295753,0.0001246634,0.939173,0.01132182,0.04439334,0.004176865,0.00002332682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04086665,0.0003241311,0.9477334,0.0003648849,0.0002176748,0.00009048371,0.0002750639,0.003218082,0.006909562],"genre_scores_gemma":[0.3195113,0.0002578897,0.6688798,0.0001614826,0.0001378919,0.000214928,0.0008550033,0.0008570572,0.009124676],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0111967,"threshold_uncertainty_score":0.03745669,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01705515478856968,"score_gpt":0.2679113503431151,"score_spread":0.2508561955545455,"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."}}