Results 1  10
of
4,723
On Orthogonalization in the Inverse Power Method
, 1999
"... When the inverse power method is used to compute eigenvectors of a symmetric matrix corresponding to close eigenvalues, the computed eigenvectors may not be orthogonal. The cure for the problem is to orthogonalize the vectors using the GramSchmidt algorithm. In this note it is shown that the o ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
When the inverse power method is used to compute eigenvectors of a symmetric matrix corresponding to close eigenvalues, the computed eigenvectors may not be orthogonal. The cure for the problem is to orthogonalize the vectors using the GramSchmidt algorithm. In this note it is shown
On the inverse power index problem
 Optimization
, 2012
"... ABSTRACT. Weighted voting games are frequently used in decision making. Each voter has a weight and a proposal is accepted if the weight sum of the supporting voters exceeds a quota. One line of research is the efficient computation of socalled power indices measuring the influence of a voter. We t ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
treat the inverse problem: Given an influence vector and a power index, determine a weighted voting game such that the distribution of influence among the voters is as close as possible to the given target value. We present exact algorithms and computational results for the Shapley
with InversePower Potential in Two Dimensions
, 1999
"... By applying a factorization ansatz for the eigenfunctions, an exact analytic solution of the stationary Schrödinger equation in two dimensions is obtained with the inversepower potential V (r) = Ar −4 + Br −3 + Cr −2 + Dr −1. ..."
Abstract
 Add to MetaCart
By applying a factorization ansatz for the eigenfunctions, an exact analytic solution of the stationary Schrödinger equation in two dimensions is obtained with the inversepower potential V (r) = Ar −4 + Br −3 + Cr −2 + Dr −1.
High dimensional graphs and variable selection with the Lasso
 ANNALS OF STATISTICS
, 2006
"... The pattern of zero entries in the inverse covariance matrix of a multivariate normal distribution corresponds to conditional independence restrictions between variables. Covariance selection aims at estimating those structural zeros from data. We show that neighborhood selection with the Lasso is a ..."
Abstract

Cited by 736 (22 self)
 Add to MetaCart
The pattern of zero entries in the inverse covariance matrix of a multivariate normal distribution corresponds to conditional independence restrictions between variables. Covariance selection aims at estimating those structural zeros from data. We show that neighborhood selection with the Lasso
NOETHERIAN SKEW INVERSE POWER SERIES RINGS
, 2008
"... We study skew inverse power series extensions R[[y −1; τ, δ]], where R is a noetherian ring equipped with an automorphism τ and a τderivation δ. We find that these extensions share many of the well known features of commutative power series rings. As an application of our analysis, we see that the ..."
Abstract
 Add to MetaCart
We study skew inverse power series extensions R[[y −1; τ, δ]], where R is a noetherian ring equipped with an automorphism τ and a τderivation δ. We find that these extensions share many of the well known features of commutative power series rings. As an application of our analysis, we see
On the inverse power laws for accelerated random fatigue testing
"... This paper addresses the usage of inverse power laws in accelerated fatigue testing under wideband Gaussian random loading. The aim is not at predicting an absolute value of fatigue life but assessing the fatigue damage relative accumulation. The widely accepted inverse power scaling laws in fatig ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
This paper addresses the usage of inverse power laws in accelerated fatigue testing under wideband Gaussian random loading. The aim is not at predicting an absolute value of fatigue life but assessing the fatigue damage relative accumulation. The widely accepted inverse power scaling laws
On Controllability of the Real Shifted Inverse Power Iteration
, 2000
"... Controllability properties of the inverse power method on projective space are investigated. For complex eigenvalue shifts a simple characterization of the reachable sets in terms of invariant subspaces can be obtained. The real case is more complicated and is investigated in this paper. Necessary a ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Controllability properties of the inverse power method on projective space are investigated. For complex eigenvalue shifts a simple characterization of the reachable sets in terms of invariant subspaces can be obtained. The real case is more complicated and is investigated in this paper. Necessary
Onedimensional inverse power reflectionless potentials −n ∗
, 2004
"... A condition, at which inverse power onedimensional potential V (x) = α/(x − x0) n (α = const, x0 = const, x ∈] − ∞,+∞[, n is a natural number) becomes reflectionless during propagation through it of a plane wave, is obtained on the basis of SUSY QM methods. A scattering of a particle on spherical ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
A condition, at which inverse power onedimensional potential V (x) = α/(x − x0) n (α = const, x0 = const, x ∈] − ∞,+∞[, n is a natural number) becomes reflectionless during propagation through it of a plane wave, is obtained on the basis of SUSY QM methods. A scattering of a particle
Query by Committee
, 1992
"... We propose an algorithm called query by committee, in which a committee of students is trained on the same data set. The next query is chosen according to the principle of maximal disagreement. The algorithm is studied for two toy models: the highlow game and perceptron learning of another perceptr ..."
Abstract

Cited by 432 (3 self)
 Add to MetaCart
gain approaches zero and the generalization error decreases with a relatively slow inverse power law. We suggest that asymptotically finite information gain may be an important characteristic of good query algorithms.
Results 1  10
of
4,723