A Generalization of the Schwarz Alternating Method to an Arbitrary Number of Subdomains.
A generalization of the steepest descent method for matrix functions.
A Generalization of the Stein-Rosenberg Theorem to Banach Spaces.
A generalized ADI iterative method.
A Generalized Conjugate Gradient Algorithm for Minimization.
A Generalized Conjugate Gradient, Least Square Method.
A generalized limited-memory BNS method based on the block BFGS update
A block version of the BFGS variable metric update formula is investigated. It satisfies the quasi-Newton conditions with all used difference vectors and gives the best improvement of convergence in some sense for quadratic objective functions, but it does not guarantee that the direction vectors are descent for general functions. To overcome this difficulty and utilize the advantageous properties of the block BFGS update, a block version of the limited-memory BNS method for large scale unconstrained...
A Generalized Treatment of the Rounding Problem. Rounding errors of Linear Functions
A geometric model for activ contours in image processing.
A Geometrical Problem Arising in a Signal Restoration Algorithm.
A Global a posteriori Error Estimate for Quasilinear Elliptic Problems.
A global analysis of Newton iterations for determining turning points
The global convergence of a direct method for determining turning (limit) points of a parameter-dependent mapping is analysed. It is assumed that the relevant extended system has a singular root for a special parameter value. The singular root is clasified as a (i.e., as a turning point). Then, the Theorz for Imperfect Bifurcation offers a particular scenario for the split of the singular root into a finite number of regular roots (turning points) due to a given parameter imperfection. The relationship...
A global approach to ground state solutions.
A global method for some class of optimization and control problems.
A Globalization Scheme for the Generalized Gauss-Newton Method.
A globally convergent non-interior point algorithm with full Newton step for second-order cone programming
A non-interior point algorithm based on projection for second-order cone programming problems is proposed and analyzed. The main idea of the algorithm is that we cast the complementary equation in the primal-dual optimality conditions as a projection equation. By using this reformulation, we only need to solve a system of linear equations with the same coefficient matrix and compute two simple projections at each iteration, without performing any line search. This algorithm can start from an arbitrary...
A Gradient Method for the Matrix Eigenvalue Problem A x = ... B x.
A gradient recovery operator based on an oblique projection.
A gradient weighted moving finite-element method with polynomial approximation of any degree.
A heat approximation
The Fourier problem on planar domains with time variable boundary is considered using integral equations. A simple numerical method for the integral equation is described and the convergence of the method is proved. It is shown how to approximate the solution of the Fourier problem and how to estimate the error. A numerical example is given.