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

Proceedings of the American Mathematical Society - United States
doi 10.1090/s0002-9939-1955-0071863-x
Full Text
Abstract

Available in full text

Date
Authors
Publisher

American Mathematical Society (AMS)

Related search

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

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1968English

Bounds for the Greatest Latent Root of a Positive Matrix

1983English

Clustering Matrix Sequences Based on the Iterative Dynamic Time Deformation Procedure

International Journal of Intelligent Systems and Applications
ControlSignal ProcessingHuman-Computer InteractionOptimizationComputer NetworksSimulationCommunicationsComputer Science ApplicationsModelingArtificial Intelligence
2018English

On the Boundedness of an Iterative Procedure for Solving a System of Linear Inequalities

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1970English

An Iterative Procedure for Certain Nonlinear Circuits

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1958English

An Iterative Aggregation Procedure for Markov Decision Processes

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1982English

Some Inequalities on the Perron Eigenvalue and Eigenvectors for Positive Tensors

Journal of Mathematical Inequalities
Analysis
2016English

An Extremum-Preserving Iterative Procedure for the Imperfect Interface Problem

Communications in Computational Physics
AstronomyPhysics
2019English

Software Module for Obtaining an Image From a Matrix Photo Receiver

Politechnical student journal
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy