A reduction method for approximate solving large elliptic systems
A refined Newton’s mesh independence principle for a class of optimal shape design problems
Shape optimization is described by finding the geometry of a structure which is optimal in the sense of a minimized cost function with respect to certain constraints. A Newton’s mesh independence principle was very efficiently used to solve a certain class of optimal design problems in [6]. Here motivated by optimization considerations we show that under the same computational cost an even finer mesh independence principle can be given.
A refined unsymmetric Lanczos eigensolver for computing accurate eigentriplets of a real unsymmetric matrix.
A Refinement Process for Collocation Approximations.
A Regularized Continuous Linearization Method of the Fourth Order
A Regularized Continuous Projection-Gradient Method of the Fourth Order
A regularized Newton method in electrical impedance tomography using shape Hessian information
A relationship between the modified Euler method and e.
A Relative Backward Perturbation Theorem for the Eigenvalue Problem.
A Relaxation Procedure for Domain Decomposition Methods Using Finite Elements.
A Reliable Argument Principle Algorithm to Find the Number of Zeros of an Analytic Function in a Bounded Domain.
A reliable method to determine the ill-condition functions using stochastic arithmetic.
A remark about a Galerkin method
It is shown that the approximating equations whose existence is required in the author's previous work on partially regular weak solutions can be constructed without any additional assumption about the equation itself. This leads to a variation of a Galerkin method.
A remark on a class of universal hill functions
A remark on approximate solving of a class of initial-boundary value problems
A remark on certain overdetermined systems of partial differential equations
A remark on cyclic tridiagonal matrices
A remark on Jordan elimination
A Remark on Long-Range Correlations in Multiplicative Congruential Pseudo Random Number Generators.
A Remark on Simultaneous Inclusions of the Zeros of a Polynomial by Gershgorin's Theorem.