A5042909824- Railway Engineering and Dynamics
- Geotechnical Engineering and Underground Structures
- Civil and Geotechnical Engineering Research
- Electromagnetic Scattering and Analysis
- Matrix Theory and Algorithms
- Electromagnetic Simulation and Numerical Methods
- Numerical methods in engineering
- Vibration and Dynamic Analysis
- Structural Engineering and Vibration Analysis
- Transportation Safety and Impact Analysis
- Geotechnical Engineering and Soil Stabilization
- Geotechnical Engineering and Soil Mechanics
- Soil Mechanics and Vehicle Dynamics
- Railway Systems and Energy Efficiency
- Structural Health Monitoring Techniques
- Electromagnetic Compatibility and Measurements
- Mechanical stress and fatigue analysis
- Composite Structure Analysis and Optimization
- Sparse and Compressive Sensing Techniques
- Advanced Numerical Methods in Computational Mathematics
- Metal Forming Simulation Techniques
- Tree Root and Stability Studies
- Tensor decomposition and applications
- Fluid Dynamics Simulations and Interactions
- Seismic Waves and Analysis
Stanford University
2016-2017
KU Leuven
2010-2017
Although some preconditioners are available for solving dense linear systems, there still many matrices which lacking, particularly in cases where the size of matrix $N$ becomes very large. Examples include incomplete LU (ILU) that sparsify based on threshold, algebraic multigrid preconditioners, and specialized e.g., Calderón other analytical approximation methods when available. Despite these methods, remains a great need to develop general purpose whose cost scales well with $N$. In this...
Inversion of sparse matrices with standard direct solve schemes is robust, but computationally expensive. Iterative solvers, on the other hand, demonstrate better scalability; but, need to be used an appropriate preconditioner (e.g., ILU, AMG, Gauss-Seidel, etc.) for proper convergence. The choice effective highly problem dependent. We propose a novel fully algebraic matrix algorithm, which has linear complexity size. Our scheme based Gauss elimination. For given matrix, we approximate LU...
This paper discusses the coupling of finite element and fast boundary methods for solution dynamic soil–structure interaction problems in frequency domain. The application hierarchical matrices formulation allows considering much larger compared to classical methods. Three methodologies are presented their computational performance is assessed through numerical examples. It demonstrated that use renders a direct approach least efficient, as it requires assembly soil stiffness matrix....
Summary We consider an efficient preconditioner for a boundary integral equation (BIE) formulation of the two‐dimensional Stokes equations in porous media. While BIEs are well‐suited resolving complex geometry, they lead to dense linear system that is computationally expensive solve large problems. This expense further amplified when significant number iterations required iterative Krylov solver such as generalized minimial residual method (GMRES). In this paper, we apply fast inexact direct...
Although some preconditioners are available for solving dense linear systems, there still many matrices which lacking, in particular cases where the size of matrix $N$ becomes very large. There remains hence a great need to develop general purpose whose cost scales well with $N$. In this paper, we propose preconditioner broad applicability and $\mathcal{O}(N)$ matrices, when is given by smooth kernel. Extending method using same framework $\mathcal{H}^2$-matrices relatively straightforward....