Multiparameter extrapolation and deflation methods for solving equation systems.
Multiplicative Schwarz Methods for Discontinuous Galerkin Approximations of Elliptic Problems
In this paper we introduce and analyze some non-overlapping multiplicative Schwarz methods for discontinuous Galerkin (DG) approximations of elliptic problems. The construction of the Schwarz preconditioners is presented in a unified framework for a wide class of DG methods. For symmetric DG approximations we provide optimal convergence bounds for the corresponding error propagation operator, and we show that the resulting methods can be accelerated by using suitable Krylov space solvers. A discussion...
Multiscale analysis of wave propagation in random media. Application to correlation-based imaging
We consider sensor array imaging with the purpose to image reflectors embedded in a medium. Array imaging consists in two steps. In the first step waves emitted by an array of sources probe the medium to be imaged and are recorded by an array of receivers. In the second step the recorded signals are processed to form an image of the medium. Array imaging in a scattering medium is limited because coherent signals recorded at the receiver array and coming from a reflector to be imaged are weak and...
Nearly optimal convergence result for multigrid with aggressive coarsening and polynomial smoothing
We analyze a general multigrid method with aggressive coarsening and polynomial smoothing. We use a special polynomial smoother that originates in the context of the smoothed aggregation method. Assuming the degree of the smoothing polynomial is, on each level , at least , we prove a convergence result independent of . The suggested smoother is cheaper than the overlapping Schwarz method that allows to prove the same result. Moreover, unlike in the case of the overlapping Schwarz method, analysis...
Nested Bounds for the Spectral Radius.
Neumann-Neumann algorithms for spectral elements in three dimensions
Neumann-Neumann methods for vector field problems.
New block triangular preconditioners for saddle point linear systems with highly singular blocks.
New iterative codes for𝓗-tensors and an application
New iterative codes for identifying 𝓗 -tensor are obtained. As an application, some sufficient conditions of the positive definiteness for an even-order real symmetric tensor, i.e., an even-degree homogeneous polynomial form are given. Advantages of results obtained are illustrated by numerical examples.
New mixed finite volume methods for second order eliptic problems
In this paper we introduce and analyze new mixed finite volume methods for second order elliptic problems which are based on H(div)-conforming approximations for the vector variable and discontinuous approximations for the scalar variable. The discretization is fulfilled by combining the ideas of the traditional finite volume box method and the local discontinuous Galerkin method. We propose two different types of methods, called Methods I and II, and show that they have distinct advantages over...
New SOR-like methods for solving the Sylvester equation
We present new iterative methods for solving the Sylvester equation belonging to the class of SOR-like methods, based on the SOR (Successive Over-Relaxation) method for solving linear systems. We discuss convergence characteristics of the methods. Numerical experimentation results are included, illustrating the theoretical results and some other noteworthy properties of the Methods.
Newton iteration for the closest normal matrix of order two.
Noise propagation in regularizing iterations for image deblurring.
Nonconforming Galerkin methods based on quadrilateral elements for second order elliptic problems
Nonconforming Galerkin methods based on quadrilateral elements for second order elliptic problems
Low-order nonconforming Galerkin methods will be analyzed for second-order elliptic equations subjected to Robin, Dirichlet, or Neumann boundary conditions. Both simplicial and rectangular elements will be considered in two and three dimensions. The simplicial elements will be based on P1, as for conforming elements; however, it is necessary to introduce new elements in the rectangular case. Optimal order error estimates are demonstrated in all cases with respect to a broken norm in H1(Ω)...
Nonexpansive matrices with applications to solutions of linear systems by fixed point iterations.
Nonmonotone strategy for minimization of quadratics with simple constraints
An algorithm for quadratic minimization with simple bounds is introduced, combining, as many well-known methods do, active set strategies and projection steps. The novelty is that here the criterion for acceptance of a projected trial point is weaker than the usual ones, which are based on monotone decrease of the objective function. It is proved that convergence follows as in the monotone case. Numerical experiments with bound-constrained quadratic problems from CUTE collection show that the modified...
Nonrecursive solution for the discrete algebraic Riccati equation and X + A*X -1 A=L
In this paper, we present two new algebraic algorithms for the solution of the discrete algebraic Riccati equation. The first algorithm requires the nonsingularity of the transition matrix and is based on the solution of a standard eigenvalue problem for a new symplectic matrix; the proposed algorithm computes the extreme solutions of the discrete algebraic Riccati equation. The second algorithm solves the Riccati equation without the assumption of the nonsingularity of the transition matrix; the...
Nonsingularity and -matrices.
New proofs of two previously published theorems relating nonsingularity of interval matrices to -matrices are given.
Non-stationary parallel multisplitting AOR methods.