• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 29,359
Next 10 →

Numerical experiments

by Combining Decomposition, Dynamic Programming , 2008
"... A large-scale stochastic optimal control problems ..."
Abstract - Add to MetaCart
A large-scale stochastic optimal control problems

numerical experiments

by A. Koel, T. Rang, G. Rang
"... in semiconductor structures using ..."
Abstract - Add to MetaCart
in semiconductor structures using

Numerical experiments

by Will Wright, Numerical Experiments , 2004
"... Kuramoto–Sivashinsky equation Allen–Cahn equation Korteweg de Vries equation Nonlinear Schrödinger equation ..."
Abstract - Add to MetaCart
Kuramoto–Sivashinsky equation Allen–Cahn equation Korteweg de Vries equation Nonlinear Schrödinger equation

Numerical experiments in homogeneous turbulence

by Robert S. Rogallo, Robert S. Rogallo, Naltonal Aeronaul_cs, Robert S Rogallo - Available from NASA Scienti & Technical Information (help@sti.nasa.gov , 1981
"... i/ ..."
Abstract - Cited by 84 (1 self) - Add to MetaCart
Abstract not found

The Runge-Kutta discontinuous Galerkin method for conservation laws V: multidimensional systems

by Bernardo Cockburn , Chi-Wang Shu , 1997
"... This is the fifth paper in a series in which we construct and study the so-called Runge-Kutta Discontinuous Galerkin method for numerically solving hyperbolic conservation laws. In this paper, we extend the method to multidimensional nonlinear systems of conservation laws. The algorithms are describ ..."
Abstract - Cited by 508 (44 self) - Add to MetaCart
are described and discussed, including algorithm formulation and practical implementation issues such as the numerical fluxes, quadrature rules, degrees of freedom, and the slope limiters, both in the triangular and the rectangular element cases. Numerical experiments for two dimensional Euler equations

Numerical Experiments in String Cosmology

by Mairi Sakellariadou - Nucl. Phys. B468 319 [hep-th/9511075 , 1996
"... We investigate some classical aspects of fundamental strings via numerical experiments. In particular, we study the thermodynamics of a string network within a toroidal universe, as a function of string energy density and space dimensionality. We find that when the energy density of the system is lo ..."
Abstract - Cited by 17 (0 self) - Add to MetaCart
We investigate some classical aspects of fundamental strings via numerical experiments. In particular, we study the thermodynamics of a string network within a toroidal universe, as a function of string energy density and space dimensionality. We find that when the energy density of the system

Compressed sensing

by Yaakov Tsaig, David L. Donoho , 2004
"... We study the notion of Compressed Sensing (CS) as put forward in [14] and related work [20, 3, 4]. The basic idea behind CS is that a signal or image, unknown but supposed to be compressible by a known transform, (eg. wavelet or Fourier), can be subjected to fewer measurements than the nominal numbe ..."
Abstract - Cited by 3625 (22 self) - Add to MetaCart
norm. We perform a series of numerical experiments which validate in general terms the basic idea proposed in [14, 3, 5], in the favorable case where the transform coefficients are sparse in the strong sense that the vast majority are zero. We then consider a range of less-favorable cases, in which

The R*-tree: an efficient and robust access method for points and rectangles

by Norbert Beckmann, Hans-Peter Kriegel, Ralf Schneider, Bernhard Seeger - INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA , 1990
"... The R-tree, one of the most popular access methods for rectangles, is based on the heuristic optimization of the area of the enclosing rectangle in each inner node. By running numerous experiments in a standardized testbed under highly varying data, queries and operations, we were able to design the ..."
Abstract - Cited by 1262 (74 self) - Add to MetaCart
The R-tree, one of the most popular access methods for rectangles, is based on the heuristic optimization of the area of the enclosing rectangle in each inner node. By running numerous experiments in a standardized testbed under highly varying data, queries and operations, we were able to design

Numerical Experiments with Symmetric Eigensolvers

by Symmetric Eigensolvers, Wilfried N. Gansterer, Dieter F. Kvasnicka, Christoph W. Ueberhuber , 1998
"... This report describes and analyzes numerical experiments carried out with various symmetric eigensolvers in the context of the material science code Wien 97. Of particular interest are the performance improvements achieved with a new Level 3 eigensolver. The techniques which lead to a significant sp ..."
Abstract - Add to MetaCart
This report describes and analyzes numerical experiments carried out with various symmetric eigensolvers in the context of the material science code Wien 97. Of particular interest are the performance improvements achieved with a new Level 3 eigensolver. The techniques which lead to a significant

Decoding by Linear Programming

by Emmanuel J. Candès, Terence Tao , 2004
"... This paper considers the classical error correcting problem which is frequently discussed in coding theory. We wish to recover an input vector f ∈ Rn from corrupted measurements y = Af + e. Here, A is an m by n (coding) matrix and e is an arbitrary and unknown vector of errors. Is it possible to rec ..."
Abstract - Cited by 1399 (16 self) - Add to MetaCart
for some ρ> 0. In short, f can be recovered exactly by solving a simple convex optimization problem (which one can recast as a linear program). In addition, numerical experiments suggest that this recovery procedure works unreasonably well; f is recovered exactly even in situations where a significant
Next 10 →
Results 1 - 10 of 29,359
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University