The following pages link to Dan Gordon (Q350157):
Displayed 30 items.
- Item:Q350157 (redirect page) (← links)
- Compact high order schemes with gradient-direction derivatives for absorbing boundary conditions (Q350159) (← links)
- Parallel solution of high frequency Helmholtz equations using high order finite difference schemes (Q450307) (← links)
- Robust and highly scalable parallel solution of the Helmholtz equation with large wave numbers (Q455841) (← links)
- Corner cutting and augmentation: An area-preserving method for smoothing polygons and polylines (Q631054) (← links)
- Computation of recursive functionals using minimal initial segments (Q787965) (← links)
- The BOXEL framework for 2.5D data with applications to virtual drivethroughs and ray tracing (Q945942) (← links)
- Row scaling as a preconditioner for some nonsymmetric linear systems with discontinuous coefficients (Q989153) (← links)
- CARP-CG: A robust and efficient parallel solver for linear systems, applied to strongly convection dominated PDEs (Q991150) (← links)
- Eliminating the flag in threaded binary search trees (Q1092666) (← links)
- Complexity classes of provable recursive functions (Q1134153) (← links)
- Minimal determining sets of locally finitely-determined functionals (Q1153082) (← links)
- Strong underrelaxation in Kaczmarz's method for inconsistent systems (Q1166890) (← links)
- A derandomization approach to recovering bandlimited signals across a wide range of random sampling rates (Q1744044) (← links)
- Compact 2D and 3D sixth order schemes for the Helmholtz equation with variable wave number (Q2249383) (← links)
- CADD: a seamless solution to the domain decomposition problem of subdomain boundaries and cross-points (Q2659698) (← links)
- Local absorbing boundary conditions for the elastic wave equation (Q2689880) (← links)
- CP3: Robust, Output-sensitive Display of Convex Polyhedra in Scanline Mode (Q2758621) (← links)
- Solution Methods for Nonsymmetric Linear Systems with Large off-Diagonal Elements and Discontinuous Coefficients (Q3112806) (← links)
- On the computational power of totalistic cellular automata (Q3763596) (← links)
- (Q3780903) (← links)
- Efficient Embeddings of Binary Trees in VLSI Arrays (Q3786430) (← links)
- Extending Classical Planning with State Constraints: Heuristics and Search for Optimal Planning (Q4580269) (← links)
- A geometric approach to quadratic optimization: an improved method for solving strongly underdetermined systems in CT (Q4908291) (← links)
- (Q5073291) (← links)
- The Well-Connected Processor Array (Q5268213) (← links)
- Component-Averaged Row Projections: A Robust, Block-Parallel Scheme for Sparse Linear Systems (Q5470356) (← links)
- Parallel ART for image reconstruction in CT using processor arrays (Q5481728) (← links)
- Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems (Q5940992) (← links)
- Conjugate gradients acceleration of coordinate descent for linear systems (Q6134425) (← links)