{"id":"W2789849740","doi":"10.3934/naco.2018007","title":"&lt;inline-formula&gt;&lt;tex-math id=\"M1\"&gt;\\begin{document} $\\mathcal{L}_{∞}$ \\end{document}&lt;/tex-math&gt;&lt;/inline-formula&gt;-norm computation for large-scale descriptor systems using structured iterative eigensolvers","year":2018,"lang":"en","type":"article","venue":"Numerical Algebra Control and Optimization","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Computation; Eigenvalues and eigenvectors; Norm (philosophy); Pencil (optics); Matrix norm; Mathematics; Iterative method; Iterative refinement; Matrix pencil; Upper and lower bounds; Algorithm; Applied mathematics; Discrete mathematics; Combinatorics; Computer science; Mathematical analysis; Physics","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001212268,0.001077805,0.001383028,0.0004352201,0.001458165,0.001522402,0.0009669285,0.0005106748,0.00007582435],"category_scores_gemma":[0.0002062064,0.0009380187,0.0003959491,0.001105785,0.0002717982,0.002946876,0.0003406966,0.0003824423,0.00004348805],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004001898,"about_ca_system_score_gemma":0.0002572706,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002730102,"about_ca_topic_score_gemma":0.00001521679,"domain_scores_codex":[0.9936236,0.0004680267,0.001667634,0.00163332,0.001139415,0.001468041],"domain_scores_gemma":[0.9958665,0.0004586614,0.001079798,0.0008113848,0.001136087,0.0006475713],"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.00130802,0.0008418088,0.000184564,0.0005798244,0.0009531733,0.0000550027,0.005456984,0.4224509,0.007899594,0.525728,0.001036884,0.03350526],"study_design_scores_gemma":[0.005719071,0.000826614,0.00008650006,0.0001579187,0.0002347686,0.00008423992,0.0001274617,0.9793629,0.0004195278,0.005511459,0.006407289,0.001062215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03607723,0.0009781769,0.9569842,0.000461362,0.002084116,0.002448848,0.0002713343,0.0005193692,0.0001753285],"genre_scores_gemma":[0.7342254,0.0001032946,0.2623774,0.0008430808,0.001245097,0.0001937656,0.0005129864,0.0001206537,0.0003783012],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6981482,"threshold_uncertainty_score":0.9998418,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00909950472901929,"score_gpt":0.2406777535330094,"score_spread":0.2315782488039901,"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."}}