Results 1  10
of
12,562
reduces matrix Ca21
"... Inhibited mitochondrial respiration by amobarbital during cardiac ischaemia improves redox state and ..."
Abstract
 Add to MetaCart
Inhibited mitochondrial respiration by amobarbital during cardiac ischaemia improves redox state and
An iterative method for the solution of the eigenvalue problem of linear differential and integral
, 1950
"... The present investigation designs a systematic method for finding the latent roots and the principal axes of a matrix, without reducing the order of the matrix. It is characterized by a wide field of applicability and great accuracy, since the accumulation of rounding errors is avoided, through the ..."
Abstract

Cited by 537 (0 self)
 Add to MetaCart
The present investigation designs a systematic method for finding the latent roots and the principal axes of a matrix, without reducing the order of the matrix. It is characterized by a wide field of applicability and great accuracy, since the accumulation of rounding errors is avoided, through
Global Optimization with Polynomials and the Problem of Moments
 SIAM JOURNAL ON OPTIMIZATION
, 2001
"... We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear ma ..."
Abstract

Cited by 577 (48 self)
 Add to MetaCart
We consider the problem of finding the unconstrained global minimum of a realvalued polynomial p(x) : R R, as well as the global minimum of p(x), in a compact set K defined by polynomial inequalities. It is shown that this problem reduces to solving an (often finite) sequence of convex linear
The Cache Performance and Optimizations of Blocked Algorithms
 In Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems
, 1991
"... Blocking is a wellknown optimization technique for improving the effectiveness of memory hierarchies. Instead of operating on entire rows or columns of an array, blocked algorithms operate on submatrices or blocks, so that data loaded into the faster levels of the memory hierarchy are reused. This ..."
Abstract

Cited by 574 (5 self)
 Add to MetaCart
given cache size, the block size that minimizes the expected number of cache misses is very small. Tailoring the block size according to the matrix size and cache parameters can improve the average performance and reduce the variance in performance for different matrix sizes. Finally, whenever possible
Factoring wavelet transforms into lifting steps
 J. FOURIER ANAL. APPL
, 1998
"... This paper is essentially tutorial in nature. We show how any discrete wavelet transform or two band subband filtering with finite filters can be decomposed into a finite sequence of simple filtering steps, which we call lifting steps but that are also known as ladder structures. This decompositio ..."
Abstract

Cited by 584 (8 self)
 Add to MetaCart
. This decomposition corresponds to a factorization of the polyphase matrix of the wavelet or subband filters into elementary matrices. That such a factorization is possible is wellknown to algebraists (and expressed by the formula); it is also used in linear systems theory in the electrical engineering community. We
A nonparametric model of random uncertainties on reduced matrix model in structural dynamics
, 2000
"... Random uncertainties in finite element models in linear structural dynamics are usually modeled by using parametric models. This means that 1) the uncertain local parameters occurring in the global mass, damping and stiffness matrices of the finite element model have to be identified; 2) appropriate ..."
Abstract

Cited by 82 (28 self)
 Add to MetaCart
) appropriate probabilistic models of these uncertain parameters have to be constructed, and 3) functions mapping the domains of uncertain parameters into the global mass, damping and stiffness matrices have to be constructed. In the lowfrequency range, a reduced matrix model can then be constructed using
The Determinants of Credit Spread Changes.
 Journal of Finance
, 2001
"... ABSTRACT Using dealer's quotes and transactions prices on straight industrial bonds, we investigate the determinants of credit spread changes. Variables that should in theory determine credit spread changes have rather limited explanatory power. Further, the residuals from this regression are ..."
Abstract

Cited by 422 (2 self)
 Add to MetaCart
with changes in credit spreads. We discuss these proposed determinants individually. Changes in the Spot Rate As pointed out by Longstaff and Schwartz (1995), the static effect of a higher spot rate is to increase the riskneutral drift of the firm value process. A higher drift reduces the incidence of default
On the fractionfree computation of columnreduced matrix polynomials via FFFG
, 2002
"... By generalizing former considerations, we show that we can modify our FFFG algorithm for computing a Matrix GCD into an algorithm which computes a columnreduced Matrix GCD or more generally a columnreduced form of a Matrix polynomial. When the matrix polynomial has coefficients from an integer doma ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
By generalizing former considerations, we show that we can modify our FFFG algorithm for computing a Matrix GCD into an algorithm which computes a columnreduced Matrix GCD or more generally a columnreduced form of a Matrix polynomial. When the matrix polynomial has coefficients from an integer
Approximating the permanent
 SIAM J. Computing
, 1989
"... Abstract. A randomised approximation scheme for the permanent of a 01 matrix is presented. The task of estimating a permanent is reduced to that of almost uniformly generating perfect matchings in a graph; the latter is accomplished by simulating a Markov chain whose states are the matchings in the ..."
Abstract

Cited by 345 (26 self)
 Add to MetaCart
Abstract. A randomised approximation scheme for the permanent of a 01 matrix is presented. The task of estimating a permanent is reduced to that of almost uniformly generating perfect matchings in a graph; the latter is accomplished by simulating a Markov chain whose states are the matchings
Results 1  10
of
12,562