نتایج جستجو برای: reducing subspace

تعداد نتایج: 259841  

Journal: :Modeling, Identification and Control: A Norwegian Research Bulletin 2005

Journal: :Physical review research 2023

Quantum simulation is one of the key applications quantum computing, which accelerates research and development in fields such as chemistry material science. The recent noisy intermediate-scale (NISQ) devices urges exploration without necessity error correction. In this paper, we propose an efficient method to simulate dynamics driven by a static Hamiltonian on NISQ devices, named subspace vari...

Journal: :Statistics 2021

Quantile regression (QR) is a well-established method of tail analysis. Application QR can become very challenging when dealing with high-dimensional data, thus requiring dimension reduction techniques. While the current literature on these techniques focuses extracting linear combinations predictor variables that contain all information about conditional quantile, non-linear features potential...

2001
Hongbo Yan Sumit Roy

The problem of blind channel identification for multirate, multi-user communication systems is addressed. By exploiting symbol rate differences, it is shown that users can .be separated based on the autocorrelation of the received signal, thus reducing the problem to the familiar single rate setting. A subspace method is then developed to identify the channel associated with each user. Simulati...

1996
Ibrahim M. Elfadel Luís Miguel Silveira Jacob K. White

Pad e approximation is an often-used method for reducing the order of a nite-dimensional, linear, time invariant, signal model. It is known to suuer from two problems: numerical instability during the computation of the Pad e coeecients and lack of guaranteed stability for the resulting reduced model even when the original system is stable. In this paper, we show how the numerical instability p...

2003
YUAN WU Vern I. Paulsen

A bounded linear operator T on a complex Hilbert space H is irreducible if it has no reducing subspace other than the trivial ones (0) and H; it is strongly irreducible if every operator similar to T is irreducible. Equivalently, T is irreducible (resp. strongly irreducible) if the only projections (resp. idempotent operators) commuting with T are 0 and I. Since (strongly) irreducible operators...

Journal: :Physical review letters 2016
Zijun Chen Julian Kelly Chris Quintana R Barends B Campbell Yu Chen B Chiaro A Dunsworth A G Fowler E Lucero E Jeffrey A Megrant J Mutus M Neeley C Neill P J J O'Malley P Roushan D Sank A Vainsencher J Wenner T C White A N Korotkov John M Martinis

Leakage errors occur when a quantum system leaves the two-level qubit subspace. Reducing these errors is critically important for quantum error correction to be viable. To quantify leakage errors, we use randomized benchmarking in conjunction with measurement of the leakage population. We characterize single qubit gates in a superconducting qubit, and by refining our use of derivative reduction...

2007
Narayanan Sundaram

Support Vector Machine is a very important technique used for classification and regression. Although very accurate, the speed of SVM classification decreases with increase in the number of support vectors. This paper describes one method of reducing the number of support vectors through the application of Kernel PCA. This method is different from other proposed methods as we show that the exac...

2013
Finnian Kelly Niko Brümmer Naomi Harte

Dealing with the effect of vocal ageing on speaker verification is an important challenge. In this paper, a new approach to improving speaker verification performance in the presence of long-term ageing is presented. Analogous to eigenchannel compensation, the proposed eigenageing compensation method operates by adapting a speaker model to a test sample based on a predetermined ageing subspace....

Journal: :SIAM J. Matrix Analysis Applications 2007
Yunkai Zhou Yousef Saad

A polynomial filtered Davidson-type algorithm is proposed for symmetric eigenproblems, in which the correction-equation of the Davidson approach is replaced by a polynomial filtering step. The new approach has better global convergence and robustness properties when compared with standard Davidson-type methods. The typical filter used in this paper is based on Chebyshev polynomials. The goal of...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید