Остановите войну!
for scientists:
default search action
Kyle A. Gallivan
- > Home > Persons > Kyle A. Gallivan
Publications
- 2021
- [j35]Melissa Marchand, Kyle A. Gallivan, Wen Huang, Paul Van Dooren:
Analysis of the Neighborhood Pattern Similarity Measure for the Role Extraction Problem. SIAM J. Math. Data Sci. 3(2): 736-757 (2021) - 2020
- [i2]Meng Wei, Wen Huang, Kyle A. Gallivan, Paul Van Dooren:
Community Detection by a Riemannian Projected Proximal Gradient Method. CoRR abs/2009.11989 (2020) - [i1]Melissa Marchand, Kyle A. Gallivan, Wen Huang, Paul Van Dooren:
Analysis of the Neighborhood Pattern Similarity Measure for the Role Extraction Problem. CoRR abs/2009.11991 (2020) - 2016
- [j28]Guifang Zhou, Wen Huang, Kyle A. Gallivan, Paul Van Dooren, Pierre-Antoine Absil:
A Riemannian rank-adaptive method for low-rank optimization. Neurocomputing 192: 72-80 (2016) - 2015
- [c47]Guifang Zhou, Wen Huang, Kyle A. Gallivan, Paul Van Dooren, Pierre-Antoine Absil:
Rank-constrained optimization: a Riemannian manifold approach. ESANN 2015 - 2010
- [j23]Paul Van Dooren, Kyle A. Gallivan, Pierre-Antoine Absil:
H2-Optimal Model Reduction with Higher-Order Poles. SIAM J. Matrix Anal. Appl. 31(5): 2738-2753 (2010) - [c45]Quentin Rentmeesters, Pierre-Antoine Absil, Paul Van Dooren, Kyle A. Gallivan, Anuj Srivastava:
An efficient particle filtering technique on the Grassmann manifold. ICASSP 2010: 3838-3841 - 2009
- [c44]Chafik Samir, Paul Van Dooren, D. Laurent, Kyle A. Gallivan, Pierre-Antoine Absil:
Elastic Morphing of 2D and 3D Objects on a Shape Manifold. ICIAR 2009: 563-572 - 2008
- [j21]Paul Van Dooren, Kyle A. Gallivan, Pierre-Antoine Absil:
H2-optimal model reduction of MIMO systems. Appl. Math. Lett. 21(12): 1267-1273 (2008) - 2004
- [j14]Kyle A. Gallivan, Antoine Vandendorpe, Paul Van Dooren:
Model Reduction of MIMO Systems via Tangential Interpolation. SIAM J. Matrix Anal. Appl. 26(2): 328-349 (2004) - [c35]Athanasios C. Antoulas, Danny C. Sorensen, Kyle A. Gallivan, Paul Van Dooren, Ananth Grama, Christoph Hoffmann, Ahmed H. Sameh:
Model Reduction of Large-Scale Dynamical Systems. International Conference on Computational Science 2004: 740-747 - 2003
- [j12]Younes Chahlaoui, Kyle A. Gallivan, Paul Van Dooren:
Recursive Calculation of Dominant Singular Subspaces. SIAM J. Matrix Anal. Appl. 25(2): 445-463 (2003) - 2001
- [c27]X. Rao, Kyle A. Gallivan, Paul Van Dooren:
Convergence analysis of a Riccati-based stabilization method. ECC 2001: 1461-1466 - 2000
- [c25]X. Rao, Kyle A. Gallivan, Paul Van Dooren:
Riccati equation-based stabilization of large scale dynamical systems. CDC 2000: 4672-4677 - 1999
- [j10]Kyle A. Gallivan, Paul Van Dooren:
Rational approximations of pre-filtered transfer functions via the Lanczos algorithm. Numer. Algorithms 20(4): 331-342 (1999) - 1996
- [j8]Kyle A. Gallivan, G. Grimme, Paul Van Dooren:
A rational Lanczos algorithm for model reduction. Numer. Algorithms 12(1): 33-63 (1996) - 1994
- [c16]Kyle A. Gallivan, Srikanth Thirumalai, Paul Van Dooren:
On Solving Block Toeplitz Systems Using a Block Schur Algorithm. ICPP (3) 1994: 274-281
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-02-07 03:54 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint