Journal Article10.1007/S00211-011-0415-Y
Nonnegative inverse eigenvalue problems with partial eigendata
TL;DR: This paper reformulates the inverse problem of constructing an n × n real nonnegative matrix A from the prescribed partial eigendata as a monotone complementarity problem and proposes a nonsmooth Newton-type method for solving its equivalent nonsm smooth equation.
read more
Abstract: In this paper we consider the inverse problem of constructing an n × n real nonnegative matrix A from the prescribed partial eigendata. We first give the solvability conditions for the inverse problem without the nonnegative constraint and then discuss the associated best approximation problem. To find a nonnegative solution, we reformulate the inverse problem as a monotone complementarity problem and propose a nonsmooth Newton-type method for solving its equivalent nonsmooth equation. Under some mild assumptions, the global and quadratic convergence of our method is established. We also apply our method to the symmetric nonnegative inverse problem and to the cases of prescribed lower bounds and of prescribed entries. Numerical tests demonstrate the efficiency of the proposed method and support our theoretical findings.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Dissertation
Inverse eigenvalue problems : theory and algorithms.
Attalla Atia,May Ramsis. +1 more
- 01 Jan 1998
33
On the alternating direction method of multipliers for nonnegative inverse eigenvalue problems with partial eigendata
TL;DR: This paper proposes several iterative schemes based on the alternating direction method of multipliers for solving the nonnegative inverse problem with partial eigendata and extends these schemes to the symmetric case and the cases of prescribed lower bounds and of prescribed entries.
3
Semidefinite inverse eigenvalue problems with prescribed entries and partial eigendata
Teng-Teng Yao,Zheng-Jian Bai +1 more
TL;DR: The alternating direction method of multipliers for solving the semidefinite inverse eigenvalue problem, where three related iterative algorithms are presented and the method is extended to the case of lower bounds.
1
Linearly structured quadratic model updating using partial incomplete eigendata
TL;DR: In this paper , a method for linearly structured quadratic model updating problem for the second order damped system is presented, where the objective is to update the model with minimum adjustment preserving the linear structure of the original damped model using partially measured incomplete eigendata.
1
References
GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems
Youcef Saad,Martin H. Schultz +1 more
TL;DR: An iterative method for solving linear systems, which has the property of minimizing at every step the norm of the residual vector over a Krylov subspace.
•Book
Optimization and nonsmooth analysis
Frank H. Clarke
- 01 Jan 1983
TL;DR: The Calculus of Variations as discussed by the authors is a generalization of the calculus of variations, which is used in many aspects of analysis, such as generalized gradient descent and optimal control.
•Book
Nonnegative Matrices in the Mathematical Sciences
Abraham Berman
- 01 Aug 1979
TL;DR: 1. Matrices which leave a cone invariant 2. Nonnegative matrices 3. Semigroups of non negative matrices 4. Symmetric nonnegativeMatrices 5. Generalized inverse- Positivity 6. M-matrices 7. Iterative methods for linear systems 8. Finite Markov Chains
7.3K
BI-CGSTAB: a fast and smoothly converging variant of BI-CG for the solution of nonsymmetric linear systems
TL;DR: Numerical experiments indicate that the new variant of Bi-CG, named Bi- CGSTAB, is often much more efficient than CG-S, so that in some cases rounding errors can even result in severe cancellation effects in the solution.
5.5K
•Book
Non-negative Matrices and Markov Chains
Eugene Seneta
- 01 Nov 2008
TL;DR: Finite Non-Negative Matrices as mentioned in this paper are a generalization of finite stochastic matrices, and finite non-negative matrices have been studied extensively in the literature.
3.3K