Results 1  10
of
968,819
Stochastic Perturbation Theory
, 1988
"... . In this paper classical matrix perturbation theory is approached from a probabilistic point of view. The perturbed quantity is approximated by a firstorder perturbation expansion, in which the perturbation is assumed to be random. This permits the computation of statistics estimating the variatio ..."
Abstract

Cited by 882 (35 self)
 Add to MetaCart
and the eigenvalue problem. Key words. perturbation theory, random matrix, linear system, least squares, eigenvalue, eigenvector, invariant subspace, singular value AMS(MOS) subject classifications. 15A06, 15A12, 15A18, 15A52, 15A60 1. Introduction. Let A be a matrix and let F be a matrix valued function of A
Convergence Properties of the NelderMead Simplex Method in Low Dimensions
 SIAM Journal of Optimization
, 1998
"... Abstract. The Nelder–Mead simplex algorithm, first published in 1965, is an enormously popular direct search method for multidimensional unconstrained minimization. Despite its widespread use, essentially no theoretical results have been proved explicitly for the Nelder–Mead algorithm. This paper pr ..."
Abstract

Cited by 570 (3 self)
 Add to MetaCart
methods, Nelder–Mead simplex methods, nonderivative optimization AMS subject classifications. 49D30, 65K05
On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models
 Annals of Applied Probability
, 1995
"... It is now known that the usual traffic condition (the nominal load being less than one at each station) is not sufficient for stability for a multiclass open queueing network. Although there has been some progress in establishing the stability conditions for a multiclass network, there is no unified ..."
Abstract

Cited by 352 (28 self)
 Add to MetaCart
, multiclass feedforward networks and firstbufferfirstserved preemptive resume discipline in a reentrant line are positive Harris recurrent under the usual traffic condition. AMS 1991 subject classification: Primary 60K25, 90B22; Secondary 60K20, 90B35. Key words and phrases: multiclass queueing networks
Universal OneWay Hash Functions and their Cryptographic Applications
, 1989
"... We define a Universal OneWay Hash Function family, a new primitive which enables the compression of elements in the function domain. The main property of this primitive is that given an element x in the domain, it is computationally hard to find a different domain element which collides with x. We ..."
Abstract

Cited by 346 (15 self)
 Add to MetaCart
schemes were based on the stronger mathematical assumption that trapdoor oneway functions exist. Key words. cryptography, randomized algorithms AMS subject classifications. 68M10, 68Q20, 68Q22, 68R05, 68R10 Part of this work was done while the authors were at the IBM Almaden Research Center. The first
Using CLAS
"... This thesis presents the results of the analysis of the reaction γ + p → K + + Λ(1405) measured with the g11a dataset taken by the CLAS collaboration at Jefferson Lab. The range of energy was from near threshold of the reaction up to a centerofmass energy of 2.840 GeV. This is the first detailed p ..."
Abstract
 Add to MetaCart
This thesis presents the results of the analysis of the reaction γ + p → K + + Λ(1405) measured with the g11a dataset taken by the CLAS collaboration at Jefferson Lab. The range of energy was from near threshold of the reaction up to a centerofmass energy of 2.840 GeV. This is the first detailed
Quantum Circuit Complexity
, 1993
"... We study a complexity model of quantum circuits analogous to the standard (acyclic) Boolean circuit model. It is shown that any function computable in polynomial time by a quantum Turing machine has a polynomialsize quantum circuit. This result also enables us to construct a universal quantum compu ..."
Abstract

Cited by 318 (1 self)
 Add to MetaCart
that the majority function does not have a linearsize quantum formula. Keywords. Boolean circuit complexity, communication complexity, quantum communication complexity, quantum computation AMS subject classifications. 68Q05, 68Q15 1 This research was supported in part by the National Science Foundation under
Publickey Cryptosystems Provably Secure against Chosen Ciphertext Attacks
 In Proc. of the 22nd STOC
, 1995
"... We show how to construct a publickey cryptosystem (as originally defined by Diffie and Hellman) secure against chosen ciphertext attacks, given a publickey cryptosystem secure against passive eavesdropping and a noninteractive zeroknowledge proof system in the shared string model. No such secure ..."
Abstract

Cited by 279 (19 self)
 Add to MetaCart
. No such secure cryptosystems were known before. Key words. cryptography, randomized algorithms AMS subject classifications. 68M10, 68Q20, 68Q22, 68R05, 68R10 A preliminary version of this paper appeared in the Proc. of the Twenty Second ACM Symposium of Theory of Computing. y Incumbent of the Morris
Immersed Interface Methods For Stokes Flow With Elastic Boundaries Or Surface Tension
 SIAM J. Sci. Comput
"... . A second order accurate interface tracking method for the solution of incompressible Stokes flow problems with moving interfaces on a uniform Cartesian grid is presented. The interface may consist of an elastic boundary immersed in the fluid or an interface between two different fluids. The interf ..."
Abstract

Cited by 115 (14 self)
 Add to MetaCart
, discontinuous coefficients, immersed interface methods, Cartesian grids, bubbles. AMS subject clas...
The Immersed Interface Method for Elliptic Equations with Discontinuous Coefficients and Singular Sources
 SIAM J. Num. Anal
, 1994
"... Abstract. The authors develop finite difference methods for elliptic equations of the form V. ((x)Vu(x)) + (x)u(x) f(x) in a region in one or two space dimensions. It is assumed that gt is a simple region (e.g., a rectangle) and that a uniform rectangular grid is used. The situation is studied in wh ..."
Abstract

Cited by 266 (31 self)
 Add to MetaCart
sources, as used in Peskin’s immersed boundary method. Key words, elliptic equation, finite difference methods, irregular domain, interface, discontinuous coefficients, singular source term, delta functions AMS subject classifications. 65N06, 65N50 1. Introduction. Consider
Users' Guide for the HarwellBoeing Sparse Matrix Collection (Release I)
, 1992
"... We describe the complete set of matrices in the HarwellBoeing sparse matrix collection, a set of standard test matrices for sparse matrix problems. This description includes some documentation for each matrix (or set of matrices) in the collection. We also describe how a copy of the collection may ..."
Abstract

Cited by 264 (23 self)
 Add to MetaCart
be obtained. Keywords: sparse matrices, test matrices, matrix collection AMS(MOS) subject classifications: 65F50, 65F05, 65F15, 65F20. 1 Current reports available by anonymous ftp from matisa.cc.rl.ac.uk in the directory "pub/reports". This report is in file duglRAL92086.ps.gz. Also published
Results 1  10
of
968,819