Sciweavers

4745 search results - page 120 / 949
» Discretization: An Enabling Technique
Sort
View
DAC
1999
ACM
15 years 10 months ago
Interconnect Analysis: From 3-D Structures to Circuit Models
In this survey paper we describethe combination of: discretized integral formulations, sparsication techniques, and krylov-subspace based model-order reduction that has led to rob...
Mattan Kamon, Nuno Alexandre Marques, Yehia Massou...
COMPGEOM
1996
ACM
15 years 10 months ago
Linear Complexity Hexahedral Mesh Generation
We show that any simply connected (but not necessarily convex) polyhedron with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face t...
David Eppstein
COMPGEOM
2008
ACM
15 years 8 months ago
Tighter bounds for random projections of manifolds
The Johnson-Lindenstrauss random projection lemma gives a simple way to reduce the dimensionality of a set of points while approximately preserving their pairwise distances. The m...
Kenneth L. Clarkson
CGF
2008
101views more  CGF 2008»
15 years 6 months ago
Spectral Conformal Parameterization
We present a spectral approach to automatically and efficiently obtain discrete free-boundary conformal parameterizations of triangle mesh patches, without the common artifacts du...
Patrick Mullen, Yiying Tong, Pierre Alliez, Mathie...
JSCIC
2007
100views more  JSCIC 2007»
15 years 6 months ago
Implicit-Explicit Schemes for BGK Kinetic Equations
In this work a new class of numerical methods for the BGK model of kinetic equations is presented. In principle, schemes of any order of accuracy in both space and time can be con...
Sandra Pieraccini, Gabriella Puppo