Research Institute for Advanced Computer Science (U.S.)
Overview
Works:  347 works in 600 publications in 1 language and 22,071 library holdings 

Classifications:  QA76, 
Publication Timeline
.
Most widely held works about
Research Institute for Advanced Computer Science (U.S.)
 RIACS annual report by Research Institute for Advanced Computer Science (U.S.)( )
 RIACS annual report, 1993 by Research Institute for Advanced Computer Science (U.S.)( Book )
 RIACS annual report, 1994 by Research Institute for Advanced Computer Science (U.S.)( Book )
Most widely held works by
Research Institute for Advanced Computer Science (U.S.)
A parallel algorithm for the Eigenvalues and Eigenvectors of a general complex matrix by
Gautam Shroff(
Book
)
1 edition published in 1989 in English and held by 179 WorldCat member libraries worldwide
1 edition published in 1989 in English and held by 179 WorldCat member libraries worldwide
Optimal expression evaluation for data parallel architectures by
J. R Gilbert(
Book
)
1 edition published in 1990 in English and held by 178 WorldCat member libraries worldwide
Abstract: "A data parallel machine represents an array or other composite data structure by allocating one processor (at least conceptually) per data item. A pointwise operation can be performed between two such arrays in unit time, provided their corresponding elements are allocated in the same processors. If the arrays are not aligned in this fashion, the cost of moving one or both of them is part of the cost of the operation. The choice of where to perform the operation then affects this cost. If an expression with several operands is to be evaluated, there may be many choices of where to perform the intermediate operations. We give an efficient algorithm to find the minimumcost way to evaluate an expression, for several different data parallel architectures
1 edition published in 1990 in English and held by 178 WorldCat member libraries worldwide
Abstract: "A data parallel machine represents an array or other composite data structure by allocating one processor (at least conceptually) per data item. A pointwise operation can be performed between two such arrays in unit time, provided their corresponding elements are allocated in the same processors. If the arrays are not aligned in this fashion, the cost of moving one or both of them is part of the cost of the operation. The choice of where to perform the operation then affects this cost. If an expression with several operands is to be evaluated, there may be many choices of where to perform the intermediate operations. We give an efficient algorithm to find the minimumcost way to evaluate an expression, for several different data parallel architectures
Neural networks and MIMDmultiprocessors by
Research Institute for Advanced Computer Science (U.S.)(
Book
)
2 editions published in 1990 in English and held by 173 WorldCat member libraries worldwide
2 editions published in 1990 in English and held by 173 WorldCat member libraries worldwide
A class of designs for a sparse distributed memory by Louis A Jaeckel(
Book
)
1 edition published in 1989 in English and held by 173 WorldCat member libraries worldwide
1 edition published in 1989 in English and held by 173 WorldCat member libraries worldwide
Chebyshev polynomials are not always optimal by
Bernd Fischer(
Book
)
2 editions published in 1989 in English and held by 173 WorldCat member libraries worldwide
We are concerned with the problem of finding among all polynomials of degree at most n and normalized to be 1 at c the one with minimal uniform norm on Epsilon. Here, Epsilon is a given ellipse with both foci on the real axis and c is a given real point not contained in Epsilon. Problems of this type arise in certain iterative matrix computations, and, in this context, it is generally believed and widely referenced that suitably normalized Chebyshev polynomials are optimal for such constrained approximation problems. In this note, we show that this is not true in general. Moreover, we derive sufficient conditions which guarantee that Chebyshev polynomials are optimal. Also, some numerical examples are presented
2 editions published in 1989 in English and held by 173 WorldCat member libraries worldwide
We are concerned with the problem of finding among all polynomials of degree at most n and normalized to be 1 at c the one with minimal uniform norm on Epsilon. Here, Epsilon is a given ellipse with both foci on the real axis and c is a given real point not contained in Epsilon. Problems of this type arise in certain iterative matrix computations, and, in this context, it is generally believed and widely referenced that suitably normalized Chebyshev polynomials are optimal for such constrained approximation problems. In this note, we show that this is not true in general. Moreover, we derive sufficient conditions which guarantee that Chebyshev polynomials are optimal. Also, some numerical examples are presented
Modula2* an extension of Modula2 for highly parallel programs by
Walter F Tichy(
Book
)
2 editions published in 1989 in English and held by 173 WorldCat member libraries worldwide
2 editions published in 1989 in English and held by 173 WorldCat member libraries worldwide
Explicitly solvable complex Chebyshev approximation problems related to sine polynomials by
Research Institute for Advanced Computer Science (U.S.)(
Book
)
2 editions published in 1989 in English and held by 173 WorldCat member libraries worldwide
2 editions published in 1989 in English and held by 173 WorldCat member libraries worldwide
The ARPANET after twenty years by
Peter J Denning(
Book
)
2 editions published in 1989 in English and held by 173 WorldCat member libraries worldwide
2 editions published in 1989 in English and held by 173 WorldCat member libraries worldwide
Bayesian learning by
Peter J Denning(
Book
)
2 editions published in 1989 in English and held by 172 WorldCat member libraries worldwide
2 editions published in 1989 in English and held by 172 WorldCat member libraries worldwide
On Bernstein type inequalities and a weighted Chebyshev approximation problem on ellipses by
Roland W Freund(
Book
)
2 editions published in 1989 in English and held by 171 WorldCat member libraries worldwide
2 editions published in 1989 in English and held by 171 WorldCat member libraries worldwide
Fast secant methods for the iterative solution of large nonsymmetric linear systems by
P Deuflhard(
Book
)
1 edition published in 1990 in English and held by 171 WorldCat member libraries worldwide
1 edition published in 1990 in English and held by 171 WorldCat member libraries worldwide
Learning to read aloud a neural network approach using sparse distributed memory by Umesh Dwarkenath Joglekar(
Book
)
1 edition published in 1989 in English and held by 171 WorldCat member libraries worldwide
1 edition published in 1989 in English and held by 171 WorldCat member libraries worldwide
A fast, preconditioned conjugate gradient Toeplitz solver by
Victor Pan(
Book
)
2 editions published in 1989 in English and held by 171 WorldCat member libraries worldwide
2 editions published in 1989 in English and held by 171 WorldCat member libraries worldwide
Numerical solution of large Lyapunov equations by
Y Saad(
Book
)
2 editions published in 1989 in English and held by 171 WorldCat member libraries worldwide
2 editions published in 1989 in English and held by 171 WorldCat member libraries worldwide
Policy issues in interconnecting networks by
B Leiner(
Book
)
1 edition published in 1989 in English and held by 170 WorldCat member libraries worldwide
1 edition published in 1989 in English and held by 170 WorldCat member libraries worldwide
Performance of low dissipative high order shockcapturing schemes for shockturbulence interactions by
Neil D Sandham(
Book
)
2 editions published in 1998 in English and held by 92 WorldCat member libraries worldwide
Abstract: "Accurate and efficient direct numerical simulation of turbulence in the presence of shock waves represents a significant challenge for numerical methods. The objective of this paper is to evaluate the performance of high order compact and noncompact central spatial differencing employing total variation diminishing (TVD) shockcapturing dissipations as characteristic based filters for two model problems combining shock wave and shear layer phenomena. A vortex pairing model evaluates the ability of the schemes to cope with shear layer instability and eddy shock waves, while a shock wave impingement on a spatiallyevolving mixing layer model studies the accuracy of computation of vortices passing through a sequence of shock and expansion waves. A drastic increase in accuracy is observed if a suitable artificial compression formulation is applied to the TVD dissipations. With this modification to the filter step the fourthorder oncompact scheme shows improved results in comparison to secondorder methods, while retaining the good shock resolution of the basic TVD scheme. For this characteristic based filter approach, however, the benefits of compact schemes or schemes with higher than fourth order are not sufficient to justify the higher complexity near the boundary and/or the additional computational cost."
2 editions published in 1998 in English and held by 92 WorldCat member libraries worldwide
Abstract: "Accurate and efficient direct numerical simulation of turbulence in the presence of shock waves represents a significant challenge for numerical methods. The objective of this paper is to evaluate the performance of high order compact and noncompact central spatial differencing employing total variation diminishing (TVD) shockcapturing dissipations as characteristic based filters for two model problems combining shock wave and shear layer phenomena. A vortex pairing model evaluates the ability of the schemes to cope with shear layer instability and eddy shock waves, while a shock wave impingement on a spatiallyevolving mixing layer model studies the accuracy of computation of vortices passing through a sequence of shock and expansion waves. A drastic increase in accuracy is observed if a suitable artificial compression formulation is applied to the TVD dissipations. With this modification to the filter step the fourthorder oncompact scheme shows improved results in comparison to secondorder methods, while retaining the good shock resolution of the basic TVD scheme. For this characteristic based filter approach, however, the benefits of compact schemes or schemes with higher than fourth order are not sufficient to justify the higher complexity near the boundary and/or the additional computational cost."
A survey of visual preprocessing and shape representation techniques by
Bruno A Olshausen(
Book
)
4 editions published in 1988 in English and held by 86 WorldCat member libraries worldwide
4 editions published in 1988 in English and held by 86 WorldCat member libraries worldwide
Totally parallel multilevel algorithms by Paul O Frederickson(
Book
)
3 editions published in 1988 in English and held by 86 WorldCat member libraries worldwide
3 editions published in 1988 in English and held by 86 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Denning, Peter J. 1942 Author
 Freund, Roland W. Author
 Saad, Y. Author
 Biswas, R. (Rupak) Author
 Schreiber, Robert Author
 Leiner, B. (Barry) Author
 Jaeckel, Louis A. Author
 Oliker, Leonid Author
 Jameson, Antony 1934 Author
 Rogers, David Author
Associated Subjects
Algebras, Linear Algorithms Approximation theory ARPANET (Computer network) Artificial intelligence Biologicallyinspired computing Chebyshev approximationComputer programs Chebyshev polynomials Compilers (Computer programs) Computer architecture Computer network protocols Computer networks Computer programming Computer storage devices Convergence Database management Data structures (Computer science) Data transmission systems Differential equations, Linear Differential equations, Partial Eigenvalues Eigenvectors Finite differences Hermite polynomials Inference Information retrieval Iterative methods (Mathematics) Lyapunov functions Machine learning MIMD computers Multiprocessors Neural networks (Computer science) Packet switching (Data transmission) Parallel computers Parallel processing (Electronic computers) Research Institute for Advanced Computer Science (U.S.) Robust control Shock waves Spatial systems Speech Statistics Steiner systems Technology assessment Turbulence
Alternative Names
Ames Research Center Research Institute for Advanced Computer Science
RIACS
United States Research Institute for Advanced Computer Science
Languages