We first recall some properties of infinite tridiagonal matrices considered as matrix transformations in sequence spaces of the forms sξ , sξ , s (c) ξ , or lp(ξ). Then, we give some results on the finite section method for approximating a solution of an infinite linear system. Finally, using a quasi-Newton method, we construct a sequence that converges fast to a solution of an infinite linear ...

Let $G$ be a locally compact group, $H$ be a compact subgroup of $G$ and $varpi$ be a representation of the homogeneous space $G/H$ on a Hilbert space $mathcal H$. For $psi in L^p(G/H), 1leq p leqinfty$, and an admissible wavelet $zeta$ for $varpi$, we define the localization operator $L_{psi,zeta} $ on $mathcal H$ and we show that it is a bounded operator. Moreover, we prove that the localizat...

In this work, we address the implementation and performance of inexact Newton-Krylov quasi-Newton algorithms, more specifically BFGS method, for solution nonlinear elasticity equations, compare them to a standard method. This is done through systematic analysis solvers with respect problem size, magnitude data number processors in both almost incompressible mechanics. We consider three test cas...

This paper shows how various limited-memory quasi-Newton large-scale unconstrained minimization methods can be used to speed up the location of global minima of potential energy surfaces related to the structures of mixed Ar-Xe clusters. Both a simulated annealing method and a finitetemperature lattice-based Monte Carlo method are accelerated by the various quasi-Newton limitedmemory methods wh...

This paper proposes a new predictor-corrector interior-point method for a class of semidefinite programs, which numerically traces the central trajectory in a space of Lagrange multipliers. The distinguished features of the method are full use of the BFGS quasi-Newton method in the corrector procedure, and an application of the conjugate gradient method with an effective preconditioning matrix ...