A note on the implementation of the accelerated successive orthogonal projections method for solving large scale linear feasibility problems (Q1110276): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Solution of sparse linear least squares problems using Givens rotations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3721676 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems / rank | |||
Normal rank |
Latest revision as of 18:24, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on the implementation of the accelerated successive orthogonal projections method for solving large scale linear feasibility problems |
scientific article |
Statements
A note on the implementation of the accelerated successive orthogonal projections method for solving large scale linear feasibility problems (English)
0 references
1988
0 references
In a recent paper [Comput. Math. Appl. 15, No.5, 367-373 (1988)] the author introduced an accelerated version of the successive orthogonal projections method which seems to be useful for solving some classes of large scale linear feasibility problems. The main step of the method involves an orthogonal projection on a linear manifold \(Bx=b\). In this note we consider the very frequent situation where the \(m\times m\) identity matrix is a submatrix of B. We develop a procedure for computing the projection which only involves ``small'' matrix factorizations.
0 references
small matrix factorizations
0 references
accelerated successive orthogonal projection method
0 references
large scale linear feasibility problems
0 references