.png){kind=icon}
Return
Improved Multiresolution Preconditioner With Loop-Flower Basis Functions
.png){kind=icon}
PRE
AI
DOI：10.1109/LAWP.2016.2634628.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, an improved multiresolution preconditioner, based on the loop-flower basis functions, has been proposed for the low-frequency problems. By using loop-flower basis function instead of loop-tree basis function as the coarse-level multiresolution basis function, the condition number of the system matrix is largely reduced, and, thus, the convergence speed of the iterative solver is greatly improved. Some numerical examples have been given to show the validity and the performance of the proposed method.
Keywords:
Loop-flower basis function
loop-tree basis function
low frequency
multiresolution (MR) preconditioner
surface-integral equation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.8
Papers:
1.0W
Citations:
2.8W
Organization
No organization information available
Cited Papers
A New Imperialist Competitive Algorithm for Multiobjective Low Carbon Parallel Machines Scheduling
OAAI
.png){kind=icon}
OAAIShareSave
ShareSaveShareSaveShareSave
View more