Related papers: Evaluations of The Hierarchical Subspace Iteration…
We provide comments on the article "High-dimensional simultaneous inference with the bootstrap" by Ruben Dezeure, Peter Buhlmann and Cun-Hui Zhang.
In this survey we present several results concerning various topologies that were introduced in recent years on spaces of valuation domains.
We propose a block Krylov subspace version of the GCRO-DR method proposed in [Parks et al.; SISC 2005], which is an iterative method allowing for the efficient minimization of the the residual over an augmented Krylov subspace. We offer a…
An iterative method is derived for image reconstruction. Among other attributes, this method allows constraints unrelated to the radiation measurements to be incorporated into the reconstructed image. A comparison is made with the widely…
In this thesis I develop a variety of techniques to train, evaluate, and sample from intractable and high dimensional probabilistic models. Abstract exceeds arXiv space limitations -- see PDF.
When analyzing empirical data, we often find that global linear models overestimate the number of parameters required. In such cases, we may ask whether the data lies on or near a manifold or a set of manifolds (a so-called multi-manifold)…
On modern parallel architectures, the cost of synchronization among processors can often dominate the cost of floating-point computation. Several modifications of the existing methods have been proposed in order to keep the communication…
This article introduces an iterative method for solving nonsingular non-Hermitian positive semidefinite systems of linear equations. To construct the iteration process, the coefficient matrix is split into two non-Hermitian positive…
A simple iteration methodology for the solution of a set of a linear algebraic equations is presented. The explanation of this method is based on a pure geometrical interpretation and pictorial representation. Convergence using this method…
This is a slightly revised version (with references added in) of a survey article which appeared in the Spring 2005 edition of the MSRI newsletter, the Emissary. The article describes some of the themes from the Fall 2004 MSRI program on…
I provide some comments on Arithmetic Teichmuller Spaces constructed in my paper arXiv:2106.11452.
We consider the iterative solution of anisotropic radiative transfer problems using residual minimization over suitable subspaces. We show convergence of the resulting iteration using Hilbert space norms, which allows us to obtain…
In this paper, a simple proof for the existence iterative scheme by using two Hilbert spaces due to Kazmi et al. [K. R. Kazmi, R. Ali, M. Furkan, Hybrid iterative method for split monotone \ldots, Numer Algor, 2017] is provided.
We review studies based on analytic and simulation methods for hierarchical performance analysis of Queueing Network - QN models, which result in an order of magnitude reduction in performance evaluation cost with respect to simulation. The…
A general asynchronous alternating iterative model is designed, for which convergence is theoretically ensured both under classical spectral radius bound and, then, for a classical class of matrix splittings for $\mathsf H$-matrices. The…
Nowadays, many fields of study are have to deal with large and sparse data matrixes, but the most important issue is finding the inverse of these matrixes. Thankfully, Krylov subspace methods can be used in solving these types of problem.…
We describe here an iterative method for jointly estimating the noise power spectrum from a scanning experiment's time-ordered data, together with the maximum-likelihood map. We test the robustness of this method on simulated datasets with…
This paper presents a systematic review of benchmarks and approaches for explainability in Machine Reading Comprehension (MRC). We present how the representation and inference challenges evolved and the steps which were taken to tackle…
This paper extends the Chandrasekhar-type recursions due to Morf, Sidhu, and Kailath "Some new algorithms for recursive estimation in constant, linear, discrete-time systems, IEEE Trans. Autom. Control 19 (1974) 315-323" to the case of…
Those seeking to reproduce a computational experiment often need to manually look at the code to see how to build necessary libraries, configure parameters, find data, and invoke the experiment; it is not automatic. Automatic…