Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Eduard Ubeda

dblp:124/6671 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2013
0000-0001-6759-0445ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational science and engineering · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational science and engineering › computational physics
computational electromagnetics
0.212013
Accelerated Direct Solution of the Method-of-Moments Linear System · Proc. IEEE 2013
Algorithms and data structures › numerical linear algebra
matrix compression
0.012013
Accelerated Direct Solution of the Method-of-Moments Linear System · Proc. IEEE 2013
Algorithms and data structures › numerical linear algebra
matrix factorization
0.012013
Accelerated Direct Solution of the Method-of-Moments Linear System · Proc. IEEE 2013

Methods — techniques the papers use, named apart from their topics

truncated SVD · 0.3multiscale compressed block decomposition · 0.3adaptive cross-approximation · 0.3
YearPublicationVenuePosition
2013 Accelerated Direct Solution of the Method-of-Moments Linear System
abstract
This paper addresses the direct (noniterative) solution of the method-of-moments (MoM) linear system, accelerated through block-wise compression of the MoM impedance matrix. Efficient matrix block compression is achieved using the adaptive cross-approximation (ACA) algorithm and the truncated singular value decomposition (SVD) postcompression. Subsequently, a matrix decomposition is applied that preserves the compression and allows for fast solution by backsubstitution. Although not as fast as some iterative methods for very large problems, accelerated direct solution has several desirable features, including: few problem-dependent parameters; fixed time solution avoiding convergence problems; and high efficiency for multiple excitation problems [e.g., monostatic radar cross section (RCS)]. Emphasis in this paper is on the multiscale compressed block decomposition (MS-CBD) algorithm, introduced by Heldring , which is numerically compared to alternative fast direct methods. A new concise proof is given for theN2computational complexity of the MS-CBD. Some numerical results are presented, in particular, a monostatic RCS computation involving 1 043 577 unknowns and 1000 incident field directions, and an application of the MS-CBD to the volume integral equation (VIE) for inhomogeneous dielectrics.
Alexander Heldring, José Maria Tamayo, Eduard Ubeda, Juan Manuel Rius
Proc. IEEE3