Estimating the matrix \(p\)-norm (Q811644): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 674 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 694 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SONEST / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power method for l\(^p\) norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rate of Convergence of Lawson's Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3314867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The calculation of linear best Lp approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5626088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Matrices in MATLAB: Design and Implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4271263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicativity of \(l_ p \)norms for matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Condition Estimates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Condition Number Estimation for Triangular Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: FORTRAN codes for estimating the one-norm of a real or complex matrix, with applications to condition estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experience with a Matrix Norm Estimator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Direct Search in Matrix Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4110164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experiences with discrete L\(_p\)-approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690974 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of the Total Approximation Problem in Separable Norms, and an Algorithm for the Total $l_1 $ Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On orthogonal linear \(\ell_1\) approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison theorems for supremum norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of a subgradient method for computing the bound norm of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On estimating the condition of eigenvalues and eigenvectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3885038 / rank
 
Normal rank

Latest revision as of 09:27, 24 June 2024

scientific article
Language Label Description Also known as
English
Estimating the matrix \(p\)-norm
scientific article

    Statements

    Estimating the matrix \(p\)-norm (English)
    0 references
    0 references
    1992
    0 references
    The Hölder \(p\)-norm of an \(m\times n\) matrix has no explicit representation unless \(p=1,2\hbox{ or }\infty\). It is shown that the \(p\)- norm can be estimated reliably in \(O(mn)\) operations. A generalization of the power method is used, with a starting vector determined by a technique with a condition estimation flavour. The algorithm nearly always computes a \(p\)-norm estimate correct to the specified accuracy, and the estimate is always within a factor \(n^{1- 1/p}\) of \(\| A\|_ p\). As a by-product, a new way is obtained to estimate the 2-norm of a rectangular matrix; this method is more general and produces better estimates in practice than a similar technique of \textit{A. K. Cline}, \textit{A. R. Conn} and \textit{C. F. Van Loan} [Lect. Notes Math. 905, 73-83 (1982; Zbl 0532.65032)].
    0 references
    condition number estimation
    0 references
    LAPACK
    0 references
    Hölder \(p\)-norm
    0 references
    power method
    0 references
    algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers