MétaCan
Menu
Back to cohort
Record W2087700323 · doi:10.1145/1838599.1838602

LU factoring of non-invertible matrices

2010· article· en· W2087700323 on OpenAlexaff
David J. Jeffrey

Bibliographic record

VenueACM communications in computer algebra · 2010
Typearticle
Languageen
FieldComputer Science
TopicMatrix Theory and Algorithms
Canadian institutionsWestern University
Fundersnot available
KeywordsFactoringInvertible matrixRank (graph theory)Extension (predicate logic)MathematicsMatrix (chemical analysis)Basis (linear algebra)Fraction (chemistry)ComputationAlgebra over a fieldComputer scienceAlgorithmPure mathematicsCombinatoricsProgramming language

Abstract

fetched live from OpenAlex

The definition of the LU factoring of a matrix usually requires that the matrix be invertible. Current software systems have extended the definition to non-square and rank-deficient matrices, but each has chosen a different extension. Two new extensions, both of which could serve as useful standards, are proposed here: the first combines LU factoring with full-rank factoring, and the second extension combines full-rank factoring with fraction-free methods. Amongst other applications, the extension to full-rank, fraction-free factoring is the basis for a fractionfree computation of the Moore-Penrose inverse.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.007
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.008
Threshold uncertainty score0.026

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.007
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0020.003
Open science0.0010.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0080.003

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.024
GPT teacher head0.294
Teacher spread0.269 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations19
Published2010
Admission routes1
Has abstractyes

Explore more

Same venueACM communications in computer algebraSame topicMatrix Theory and AlgorithmsFrench-language works237,207