{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007427572,0.0001080331,0.0002895353,0.0001210115,0.0002332935,0.0001571398,0.0005051396,0.00003782657,0.000004420897],"category_scores_gemma":[0.00005044366,0.00008515445,0.00007813017,0.00007404255,0.00009497066,0.0001263046,0.0001340353,0.000107318,0.000004188001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001080898,"about_ca_system_score_gemma":0.00007779301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.967142e-7,"about_ca_topic_score_gemma":6.519601e-8,"domain_scores_codex":[0.9987683,0.00001729365,0.0005538036,0.0001043073,0.0004485451,0.0001076933],"domain_scores_gemma":[0.9979877,0.00030049,0.001271689,0.0001361492,0.0002266466,0.00007731812],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001839753,0.0002948265,0.00002393944,0.0001551766,0.00006413821,0.000008109617,0.0006831302,0.1472673,0.0003875662,0.8347513,0.00007463366,0.01627147],"study_design_scores_gemma":[0.0008887263,0.00009249859,0.002147907,0.0001014336,0.00003700194,0.0001670061,0.00007720302,0.4828863,0.001135759,0.5122902,0.00004464379,0.0001313268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2262711,0.0001439832,0.7723356,0.0002264511,0.0001322613,0.00007616412,0.000003582384,0.000008627198,0.0008021833],"genre_scores_gemma":[0.6487898,0.000009880185,0.3511027,0.00001708692,0.00006713896,7.324227e-7,4.924415e-7,0.000003806002,0.000008430625],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4225186,"threshold_uncertainty_score":0.3472498,"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."}}