scholarly journals The spectral condition number plot for regularization parameter evaluation

2019 ◽  
Vol 35 (2) ◽  
pp. 629-646 ◽  
Author(s):  
Carel F. W. Peeters ◽  
Mark A. van de Wiel ◽  
Wessel N. van Wieringen
Author(s):  
Stefan Kunis ◽  
Dominik Nagel

Abstract We prove upper and lower bounds for the spectral condition number of rectangular Vandermonde matrices with nodes on the complex unit circle. The nodes are “off the grid,” pairs of nodes nearly collide, and the studied condition number grows linearly with the inverse separation distance. Such growth rates are known in greater generality if all nodes collide or for groups of colliding nodes. For pairs of nodes, we provide reasonable sharp constants that are independent of the number of nodes as long as non-colliding nodes are well-separated.


2019 ◽  
Vol 26 (3) ◽  
pp. e2235 ◽  
Author(s):  
Haim Avron ◽  
Alex Druinsky ◽  
Sivan Toledo

1974 ◽  
Vol 8 (2) ◽  
pp. 157-178 ◽  
Author(s):  
T.I. Fenner ◽  
G. Loizou

2018 ◽  
Vol 34 ◽  
pp. 566-581
Author(s):  
Paris Vassalos

This work studies the asymptotic behavior of the spectral condition number of the matrices $A_{nn}$ arising from the discretization of semi-elliptic partial differential equations of the form \bdm -\left( a(x,y)u_{xx}+b(x,y)u_{yy}\right)=f(x,y), \edm on the square $\Omega=(0,1)^2,$ with Dirichlet boundary conditions, where the smooth enough variable coefficients $a(x,y), b(x,y)$ are nonnegative functions on $\overline{\Omega}$ with zeros. In the case of coefficient functions with a single and common zero, it is discovered that apart from the minimum order of the zero also the direction that it occurs is of great importance for the characterization of the growth of the condition number of $A_{nn}$. On the contrary, when the coefficient functions have non intersecting zeros, it is proved that independently of the order their zeros, and their positions, the condition number of $A_{nn}$ behaves asymptotically exactly as in the case of strictly elliptic differential equations, i.e., it grows asymptotically as $n^2$. Finally, the more complicated case of coefficient functions having curves of roots is considered, and conjectures for future work are given. In conclusion, several experiments are presented that numerically confirm the developed theoretical analysis.


Author(s):  
Mohammed Yusuf Waziri ◽  
Kabiru Ahmed ◽  
Abubakar Sani Halilu ◽  
Jamilu Sabiu

Notwithstanding its efficiency and nice attributes, most research on the iterative scheme by Hager and Zhang [Pac. J. Optim. 2(1) (2006) 35-58] are focused on unconstrained minimization problems. Inspired by this and recent works by Waziri et al. [Appl. Math. Comput. 361(2019) 645-660], Sabi’u et al. [Appl. Numer. Math. 153(2020) 217-233], and Sabi’u et al. [Int. J. Comput. Meth, doi:10.1142/S0219876220500437], this paper extends the Hager-Zhang (HZ) approach to nonlinear monotone systems with convex constraint. Two new HZ-type iterative methods are developed by combining the prominent projection method by Solodov and Svaiter [Springer, pp 355-369, 1998] with HZ-type search directions, which are obtained by developing two new parameter choices for the Hager-Zhang scheme. The first choice, is obtained by minimizing the condition number of a modified HZ direction matrix, while the second choice is realized using singular value analysis and minimizing the spectral condition number of the nonsingular HZ search direction matrix. Interesting properties of the schemes include solving non-smooth functions and generating descent directions. Using standard assumptions, the methods’ global convergence are obtained and numerical experiments with recent methods in the literature, indicate that the methods proposed are promising. The schemes effectiveness are further demonstrated by their applications to sparse signal and image reconstruction problems, where they outperform some recent schemes in the literature.


2014 ◽  
Vol 22 (4) ◽  
Author(s):  
O. Axelsson

Abstract-By use of an additive subspace preconditioning method it is shown how a set of small eigenvalues of a given system operator can be moved to the upper part of the spectrum, thereby significantly improving the spectral condition number and the rate of convergence of the iterative solution method used for the corresponding preconditioned system.


Sign in / Sign up

Export Citation Format

Share Document