default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVadim Olshevsky
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i5]S. Dogruer Akgul, Anastasiia Minenkova, Vadim Olshevsky:
Existence of flipped orthogonal conjugate symmetric Jordan canonical bases for real H-selfadjoint matrices. CoRR abs/2203.09877 (2022)- [i4]S. Dogruer Akgul, Anastasiia Minenkova, Vadim Olshevsky:
Lipschitz stability of γ-FOCS and RC canonical Jordan bases of real H-selfadjoint matrices under small perturbations. CoRR abs/2204.04639 (2022) - 2021
- [i3]Anastasiia Minenkova, Evelyn Nitch-Griffin, Vadim Olshevsky:
Gohberg-Kaashoek Numbers and Stability of the Schur Canonical Form. CoRR abs/2108.02312 (2021) - [i2]Anastasiia Minenkova, Evelyn Nitch-Griffin, Vadim Olshevsky:
Gohberg-Kaashoek Numbers and Forward Stability of the Schur Canonical Form. CoRR abs/2110.15334 (2021)
2010 – 2019
- 2014
- [i1]Sirani M. Perera, Grigory Bonik, Vadim Olshevsky:
A Fast Algorithm for the Inversion of Quasiseparable Vandermonde-like Matrices. CoRR abs/1401.1874 (2014) - 2013
- [j9]Froilán M. Dopico, Vadim Olshevsky, Pavel Zhlobich:
Stability of QR-based fast system solvers for a subclass of quasiseparable rank one matrices. Math. Comput. 82(284): 2007-2034 (2013) - [j8]Tom Bella, Vadim Olshevsky, Michael Stewart:
Nested Product Decomposition of Quasiseparable Matrices. SIAM J. Matrix Anal. Appl. 34(4): 1520-1555 (2013)
2000 – 2009
- 2009
- [j7]Tom Bella, Yuli Eidelman, Israel Gohberg, Israel Koltracht, Vadim Olshevsky:
A Fast Björck-Pereyra-Type Algorithm for Solving Hessenberg-Quasiseparable-Vandermonde Systems. SIAM J. Matrix Anal. Appl. 31(2): 790-815 (2009) - 2008
- [j6]Tom Bella, Yuli Eidelman, Israel Gohberg, Vadim Olshevsky:
Computations with quasiseparable polynomials and matrices. Theor. Comput. Sci. 409(2): 158-179 (2008) - 2005
- [j5]Thomas Kailath, Vadim Olshevsky:
Displacement Structure Approach to Discrete-Trigonometric-Transform Based Preconditioners of G.Strang Type and of T.Chan Type. SIAM J. Matrix Anal. Appl. 26(3): 706-734 (2005) - [j4]Vadim Olshevsky, Lev Sakhnovich:
Matched Filtering for Generalized Stationary Processes. IEEE Trans. Inf. Theory 51(9): 3308-3313 (2005) - 2001
- [j3]Vadim Olshevsky, Michael Stewart:
Stable factorization for Hankel and Hankel-like matrices. Numer. Linear Algebra Appl. 8(6-7): 401-434 (2001) - 2000
- [c4]Vadim Olshevsky, Mohammad Amin Shokrollahi:
Matrix-vector product for confluent Cauchy-like matrices with application to confluent rational interpolation. STOC 2000: 573-581
1990 – 1999
- 1999
- [c3]Vadim Olshevsky, Victor Y. Pan:
Polynomial and Rational Evaluation and Interpolation (with Structured Matrices). ICALP 1999: 585-594 - [c2]Vadim Olshevsky, Mohammad Amin Shokrollahi:
A Displacement Approach to Efficient Decoding of Algebraic-Geometric Codes. STOC 1999: 235-244 - 1998
- [c1]Vadim Olshevsky, Victor Y. Pan:
A Unified Superfast Algorithm for Boundary Rational Tangential Interpolation Problems and for Inversion and Factorization of Dense Structured Matrices. FOCS 1998: 192-201 - 1997
- [j2]Israel Gohberg, Vadim Olshevsky:
The Fast Generalized Parker-Traub Algorithm for Inversion of Vandermonde and Related Matrices. J. Complex. 13(2): 208-234 (1997) - 1994
- [j1]Israel Gohberg, Vadim Olshevsky:
Fast Algorithms with Preprocessing for Matrix-Vector Multiplication Problems. J. Complex. 10(4): 411-427 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
