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

Mathematics of Computation - United States
doi 10.2307/2004587
Full Text
Abstract

Available in full text

Date
Authors
Publisher

JSTOR

Related search

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

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1955English

An Iterative Method for Computing the Generalized Inverse of an Arbitrary Matrix

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1965English

Bounds for the Greatest Latent Root of a Positive Matrix

1983English

An Enumerative Procedure for Identifying Maximal Covers

Revista de Matemática: Teoría y Aplicaciones
2009English

An Iterative Procedure for Certain Nonlinear Circuits

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1958English

ZNN Models for Computing Matrix Inverse Based on Hyperpower Iterative Methods

Filomat
Mathematics
2017English

An Iterative Aggregation Procedure for Markov Decision Processes

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1982English

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

An Extremum-Preserving Iterative Procedure for the Imperfect Interface Problem

Communications in Computational Physics
AstronomyPhysics
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy