Domain decomposition methods are powerful numerical techniques used to solve partial differential equations (PDEs) by breaking down a large problem into smaller, more manageable subproblems. This ...

Domain decomposition methods constitute a fundamental strategy in numerical analysis, enabling the partitioning of large and complex computational problems into smaller, more manageable sub-problems.

In this paper some of the numerical problems associated with computing the generalized inverse of a matrix are discussed and illustrated by a detailed analysis of an iteration of Ben-Israel and Cohen.

The boundary value problems (BVPs) have attracted the attention of many scientists from both practical and theoretical points of view, for these problems have remarkable applications in different ...

This paper is concerned with the acceleration, by Chebyshev acceleration or conjugate gradient acceleration, of basic iterative methods for solving systems of linear algebraic equations. It is shown ...

We introduce some iterative methods for solving the linear system $\boldsymbol{Ax}=\boldsymbol{b}$ in this chapter. Why do we need iterative methods? Reduce the cost ...

This is the repository of course materials for the 18.335J/6.7310J course at MIT, taught by Dr. Shi Chen, in Spring 2025. Topics: Advanced introduction to numerical linear algebra and related ...

Abstract: An iterative hybrid method is proposed for analyzing the electromagnetic (EM) scattering from complex target above rough surface. First, the electric/magnetic current-combined field integral ...

General aspects of polynomial interpolation theory. Formulations in different basis, e.g. Lagrange, Newton etc. and their approximation and computational properties ...

Abstract: Operating room (OR) is a critical and costly asset in hospitals. Effective management is crucial for cost reduction, improved patient outcomes, and resource optimization in ORs. To bolster ...