Bounds for the Greatest Latent Root of a Positive Matrix

doi 10.1007/978-3-0348-9355-8_15
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Birkhäuser Basel

Related search

An Iterative Procedure for Computing the Maximal Root of a Positive Matrix

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1968English

On an Iterative Procedure for Obtaining the Perron Root of a Positive Matrix

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1955English

Sequences of Bounds for the Spectral Radius of a Positive Operator

Linear Algebra and Its Applications
Numerical AnalysisAlgebraCombinatoricsNumber TheoryGeometryDiscrete MathematicsTopology
2019English

Probabilistic Upper Bounds for the Matrix Two-Norm

Journal of Scientific Computing
Numerical AnalysisApplied MathematicsComputational TheoryEngineeringComputational MathematicsMathematicsTheoretical Computer ScienceSoftware
2013English

Efficient Computation of the Latent Vectors of a Matrix

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
1943English

Lower Bounds for the Condition Number of a Real Confluent Vandermonde Matrix

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2006English

A Priori Bounds for Positive Solutions of a Semilinear Elliptic Equation

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1985English

Upper and Lower Bounds for Ranks of the Matrix ExpressionX-XAX

Abstract and Applied Analysis
Applied MathematicsAnalysis
2013English

Functions Preserving Matrix Groups and Iterations for the Matrix Square Root

SIAM Journal on Matrix Analysis and Applications
Analysis
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy