Results 1  10
of
568
Multilevel Fast Multipole Algorithm for Solving Combined Field Integral Equation of Electromagnetic Scattering
, 1995
"... The fast multipole method (FMM) has been implemented to speed up the matrixvector multiply when an iterative method is used to solve combined field integral equation (CFIE). FMM reduces the complexity from O(N 2 ) to O(N 1:5 ). With a multilevel fast multipole algorithm (MLFMA), it is further re ..."
Abstract

Cited by 194 (11 self)
 Add to MetaCart
The fast multipole method (FMM) has been implemented to speed up the matrixvector multiply when an iterative method is used to solve combined field integral equation (CFIE). FMM reduces the complexity from O(N 2 ) to O(N 1:5 ). With a multilevel fast multipole algorithm (MLFMA), it is further
Separation Analysis, a Tool for Analyzing Multigrid Algorithms
"... The separation of vectors by multigrid (MG) algorithms is applied to the study of convergence and to the prediction of the performance of MG algorithms. The separation operator for a two level cycle algorithm is derived. It is used to analyze the e ciency of the cycle when mixing of eigenvectors occ ..."
Abstract
 Add to MetaCart
The separation of vectors by multigrid (MG) algorithms is applied to the study of convergence and to the prediction of the performance of MG algorithms. The separation operator for a two level cycle algorithm is derived. It is used to analyze the e ciency of the cycle when mixing of eigenvectors
Numerical criteria for divisors on Mg to be ample
, 2003
"... The moduli space Mg,n of n−pointed stable curves of genus g is stratified by the topological type of the curves being parametrized: the closure of the locus of curves with k nodes has codimension k. The one dimensional components of this stratification are smooth rational curves (whose numerical eq ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
, an algorithm is described to check that a given divisor is ample (cf. Theorem/Algorithm 4.5). Using a computer program called The Nef Wizard, written by Daniel Krashen, one can use the criteria and the algorithm to verify the conjecture for low genus. This is done on Mg for g ≤ 24, more than doubling the known
M.G.: Topological active nets optimization using genetic algorithms
"... Abstract. The Topological Active Net (TAN) model is a deformable model used for image segmentation. It integrates features of region–based and edge–based segmentation techniques. This way, the model is able to fit the edges of the objects and model their inner topology. The model consists of a two d ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
dimensional mesh controlled by energy functions. The minimization of these energy functions leads to the TAN adjustment. This paper presents a new approach to the energy minimization process based on genetic algorithms (GA), that defines several suitable genetic operators for the optimization task
The Incomplete Factorization Multigraph Algorithm
 SIAM J. SCI. COMPUT
"... We present a new family of multigraph algorithms, ILUMG, based upon an incomplete sparse matrix factorization using a particular ordering and allowing a limited amount of fillin. While much of the motivation for multigraph comes from multigrid ideas, ILUMG is distinctly different from algebraic ..."
Abstract

Cited by 26 (4 self)
 Add to MetaCart
We present a new family of multigraph algorithms, ILUMG, based upon an incomplete sparse matrix factorization using a particular ordering and allowing a limited amount of fillin. While much of the motivation for multigraph comes from multigrid ideas, ILUMG is distinctly different from algebraic
A Comparative Study of the NAS MG Benchmark across Parallel Languages and Architectures
 IN SUPERCOMPUTING ’00: PROCEEDINGS OF THE 2000 ACM/IEEE CONFERENCE ON SUPERCOMPUTING
, 2000
"... Hierarchical algorithms such as multigrid applications form an important cornerstone for scientific computing. In this study, we take a first step toward evaluating parallel language support for hierarchical applications by comparing implementations of the NAS MG benchmark in several parallel prog ..."
Abstract

Cited by 34 (6 self)
 Add to MetaCart
Hierarchical algorithms such as multigrid applications form an important cornerstone for scientific computing. In this study, we take a first step toward evaluating parallel language support for hierarchical applications by comparing implementations of the NAS MG benchmark in several parallel
The Dykstra algorithm with Bregman projections
 Communications in Applied Analysis
, 1998
"... ABSTRACT: Let fCi j 1 i mg be a nite family of closed convex subsets of R n, and assume that their intersection C = \fCi j 1 i mg is not empty. In this paper we propose a general Dykstratype sequential algorithm for nding the Bregman projection of a given point r 2 R n onto C and show thatitconverg ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
ABSTRACT: Let fCi j 1 i mg be a nite family of closed convex subsets of R n, and assume that their intersection C = \fCi j 1 i mg is not empty. In this paper we propose a general Dykstratype sequential algorithm for nding the Bregman projection of a given point r 2 R n onto C and show
PNA Probability, Networks and Algorithms Probability, Networks and Algorithms
, 2004
"... Sojourn times in the M/G/1 FB queue with lighttailed service times ..."
Written by M.G. van der Zon
"... Adding robustness and scalability to existing data mining algorithms for successful handling of large data sets ..."
Abstract
 Add to MetaCart
Adding robustness and scalability to existing data mining algorithms for successful handling of large data sets
Numerical Methods for M/G/1 Type Queues
, 1995
"... Queues of M/G/1 type give rise to infinite embedded Markov chains whose transition matrices are upper block Hessenberg. The traditional algorithms for solving these queues have involved the computation of an intermediate matrix G. Recently a recursive descent method for solving block Hessenberg syst ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Queues of M/G/1 type give rise to infinite embedded Markov chains whose transition matrices are upper block Hessenberg. The traditional algorithms for solving these queues have involved the computation of an intermediate matrix G. Recently a recursive descent method for solving block Hessenberg
Results 1  10
of
568