Frank Uhlig

Orcid: 0000-0002-7495-5753

According to our database1, Frank Uhlig authored at least 17 papers between 2005 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Constructing the field of values of decomposable and general matrices using the ZNN based path following method.
Numer. Linear Algebra Appl., December, 2023

A New Approach to Shooting Methods for Terminal Value Problems of Fractional Differential Equations.
J. Sci. Comput., November, 2023

2022
Correction to: On the unitary block-decomposability of 1-parameter matrix flows and static matrices.
Numer. Algorithms, 2022

On the unitary block-decomposability of 1-parameter matrix flows and static matrices.
Numer. Algorithms, 2022

Adapted AZNN Methods for Time-Varying and Static Matrix Problems.
CoRR, 2022

Exploring the Social Context of Collaborative Driving.
CoRR, 2022

2021
Iterative optimal solutions of linear matrix equations for Hyperspectral and Multispectral image fusing.
CoRR, 2021

2020
Coalescing Eigenvalues and Crossing Eigencurves of 1-Parameter Matrix Flows.
SIAM J. Matrix Anal. Appl., 2020

Zeroing Neural Networks, an Introduction to, a Survey of, and Predictive Computations for Time-varying Matrix Problems.
CoRR, 2020

The Eight Epochs of Math as regards past and future Matrix Computation.
CoRR, 2020

Constructing the Field of Values of Decomposable and General Matrices.
CoRR, 2020

On the Decomposability of 1-Parameter Matrix Flows.
CoRR, 2020

2019
A 5-instant finite difference formula to find discrete time-varying generalized matrix inverses, matrix inverses, and scalar reciprocals.
Numer. Algorithms, 2019

2018
Z-type neural-dynamics for time-varying nonlinear optimization under a linear equality constraint with robot application.
J. Comput. Appl. Math., 2018

2011
What can clusters tell us about the bulk?: Peacemaker: Extended quantum cluster equilibrium calculations.
Comput. Phys. Commun., 2011

2009
Geometric computation of the numerical radius of a matrix.
Numer. Algorithms, 2009

2005
Improved methods and starting values to solve the matrix equations X±A<sup>*</sup>X<sup>-1</sup>A=I iteratively.
Math. Comput., 2005


  Loading...