Learn More
SUMMARY We introduce a new preconditioning technique for iteratively solving linear systems arising from finite element discretization of the mixed formulation of the time-harmonic Maxwell equations. The preconditioners are motivated by spectral equivalence properties of the discrete operators, but are augmentation-free and Schur complement-free. We provide(More)
Interior-point methods feature prominently among numerical methods for inequality-constrained optimization problems, and involve the need to solve a sequence of linear systems that typically become increasingly ill-conditioned with the iterations. To solve these systems, whose original form has a nonsymmetric 3×3 block structure, it is common practice to(More)
Following inoculation of host and nonhost plants with Plasmopara viticola, the grapevine downy mildew, a histological survey was undertaken to identify the stage where its development is contained in nonhosts and in resistant host plants. Three herbaceous nonhost species, Beta vulgaris, Lactuca sativa, and Capsicum annuum, and three grapevine species(More)
We perform an algebraic analysis of a generalization of the augmented Lagrangian method for solution of saddle point linear systems. It is shown that in cases where the (1,1) block is singular, specifically semidefinite, a low-rank perturbation that minimizes the condition number of the perturbed matrix while maintaining sparsity is an effective approach.(More)
We introduce an &ell;<sub>1</sub>-sparse method for the reconstruction of a piecewise smooth point set surface. The technique is motivated by recent advancements in sparse signal reconstruction. The assumption underlying our work is that common objects, even geometrically complex ones, can typically be characterized by a rather small number of features.(More)
We first explore methods for approximating the commute time and Katz score between a pair of nodes. These methods are based on the approach of matrices, moments , and quadrature developed in the numerical linear algebra community. They rely on the Lanczos process and provide upper and lower bounds on an estimate of the pair-wise scores. We also explore(More)
The three results on the PageRank vector are preliminary but shed light on the eigenstructure of a PageRank modified Markov chain and what happens when changing the teleportation parameter in the PageRank model. Computations with the derivative of the PageRank vector with respect to the teleportation parameter show predictive ability and identify an(More)