The main idea is to transform the constrained 2-1 minimization problem obtained by applying the IRLS method to a 2-2 one that allow regularization matrices in the usual 2-norm regularization term. The regularization parameter that controls the equilibrium between the minimization of the two terms ...
The procedure to determine the stepsize is similar to the adaptive strategy used in many ODE solvers. We assume that the error is approximately Cτq+1, for some constants q,C∈R. The order q is set to q=m4−1 for the first step as in [21] and if a previously suggested stepsize...
V. Venkatakrishnan and D. J. Mavriplis. Implicit solvers for unstructured grids. InProceedings of the AIAA 10th CFD Conference, June, 1991, HI., 1991. Google Scholar V. Venkatakrishnan, H. D. Simon, and T. J. Barth. A MIMD Implementation of a Parallel Euler Solver for Unstructured ...
block Krylov subspace methodslow-rank compressionrestartsBlock Krylov subspace methods (KSMs) comprise building blocks in many state-of-the-art solvers for large-scale matrix equations as they arise, e.g., from the discretization of partial differential equations. While extended and rational block ...
Yamazaki, I., Thomas, S., Hoemmen, M., Boman, E.G., S´ wirydowicz, K., Eilliot, J.J.: Low- synchronization orthogonalization schemes for s-step and pipelined Krylov solvers in Trilinos. In: Proceedings of the 2020 SIAM conference on parallel processing for scientific computing (PP...
Therefore it is our plan to concentrate a further research on development of (parallel) preconditioned iterative solvers, possibly including the recent developments in algebraic multigrid methods (as, e.g., [91]) and the so-called Krylov subspace recycling techniques [92]. The Matlab ...
Iterative solvers for 3D linear and nonlinear elasticity problems: Displacement and mixed formulations We present new iterative solvers for large-scale linear algebraic systems arising from the finite element discretization of the elasticity equations. We fo... AE Maliki,M Fortin,N Tardieu,... - 《...
consider that a complex-valuedn×nlinear systemAx=bcan always be rewritten using only real arithmetic as a2n×2nreal-valued system. The primary reason to developLightKrylovis to couple it with high-performance solvers in computational mechanics which often use exclusively real-valued data types. As...
Singh, A. Mahindra, Krylov subspace solvers in parallel numerical computations of partial differential equations modeling heat transfer applications, Numer. Heat Transf. A, 45 (2004) 479-503.B. V. Rathish Kumar, B. Kumar, Shalimi, M. Mehra, P. Chandra, V. Raghvendra, R. K. Singh, and...
Iterative solvers based on Krylov subspace method proved to be robust in the presence of well monitored inexact matrix vector products. In this paper, we show that the iterative solver performs well while gradually reducing the number of nonzero elements of the matrix throughout the iterations. ...