Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

R. J. Painter

dblp:01/1139 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1970
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Algorithms and data structures · 67% Mathematical optimization · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization
least squares
0.011970
Note on a Least Squares Inverse for a Matrix · J. ACM 1970
Algorithms and data structures
linear algebra
0.011970
Note on a Least Squares Inverse for a Matrix · J. ACM 1970
Algorithms and data structures › numerical linear algebra › generalized inverse
matrix inversion
0.011970
Note on a Least Squares Inverse for a Matrix · J. ACM 1970
YearPublicationVenuePosition
1970 Note on a Least Squares Inverse for a Matrix
abstract
For an m X n complex matrix A, a least squares inverse for A is used to characterize the set of all least squares solutions of an inconsistent system of equations AX = b, and two representations for a least squares inverse of a partitioned matrix are obtained.
C. D. Meyer, R. J. Painter
J. ACM2