2000 character limit reached
The scalability of the matrices in direct Trefftz method in 2D Laplace problem
Published 12 Nov 2015 in cs.NA and math.NA | (1511.03925v1)
Abstract: This paper presents an interesting property of the matrices that may be obtained with the use of direct Trefftz method. It is proved analytically for 2D Laplace problem that values of the elements of matrices describing the capacitance of two scaled domains are inversely proportional to the scalability factor. As an example of the application the capacitance extraction problem is chosen. Concise description of the algorithm in which the scalability property can be utilized is given. Furthermore some numerical results of the algorithm are presented.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.