Fritz Keinert
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Fritz Keinert has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Todor Cooklev
Purdue University
6 shared publications Vasil Kolev
4 shared publications- Eric S. Weber
Iowa State University
2 shared publications - Vasil Kolev
Bulgarian Academy of Sciences
2 shared publications - Ahmet Altürk
Amasya University
1 shared publication - Ahmet Altürk
Department of Mathematics, Iowa State University, Ames, IA 50011, United States
1 shared publication
Latest Publications
- Open Access
- 14 August 2026
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 491
New orthogonal multiwavelet filters derived by matrix spectral factorization
- 14 August 2026
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 491
Open AccessNew orthogonal multiwavelet filters derived by matrix spectral factorization
- Open Access
Bauer's Spectral Factorization Method for Low Order Multiwavelet Filter Design
Para-Hermitian polynomial matrices obtained by matrix spectral factorization lead to functions useful in control theory systems, basis functions in numerical methods or multiscaling functions used in signal processing. We introduce a fast algorithm for matrix spectral factorization based on Bauer$'$s method. We convert Bauer$'$ method into a nonlinear matrix equation (NME). The NME is solved by two different numerical algorithms (Fixed Point Iteration and Newton$'$s Method) which produce approximate scalar or matrix factors, as well as a symbolic algorithm which produces exact factors in closed form for some low-order scalar or matrix polynomial matrices, respectively. Convergence rates of the two numerical algorithms are investigated for a number of singular and nonsingular scalar and matrix polynomials taken from different areas. In particular, one of the singular examples leads to new orthogonal multiscaling and multiwavelet filters. Since the NME can also be solved as a Generalized Discrete Time Algebraic Riccati Equation (GDARE), numerical results using built-in routines in Maple 17.0 and 6 Matlab versions are presented.
Open AccessBauer's Spectral Factorization Method for Low Order Multiwavelet Filter Design
Para-Hermitian polynomial matrices obtained by matrix spectral factorization lead to functions useful in control theory systems, basis functions in numerical methods or multiscaling functions used in signal processing. We introduce a fast algorithm for matrix spectral factorization based on Bauer$'$s method. We convert Bauer$'$ method into a nonlinear matrix equation (NME). The NME is solved by two different numerical algorithms (Fixed Point Iteration and Newton$'$s Method) which produce approximate scalar or matrix factors, as well as a symbolic algorithm which produces exact factors in closed form for some low-order scalar or matrix polynomial matrices, respectively. Convergence rates of the two numerical algorithms are investigated for a number of singular and nonsingular scalar and matrix polynomials taken from different areas. In particular, one of the singular examples leads to new orthogonal multiscaling and multiwavelet filters. Since the NME can also be solved as a Generalized Discrete Time Algebraic Riccati Equation (GDARE), numerical results using built-in routines in Maple 17.0 and 6 Matlab versions are presented.
- 30 November 2023
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 441
Bauer’s spectral factorization method for low order multiwavelet filter design
- 30 November 2023
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 441
Bauer’s spectral factorization method for low order multiwavelet filter design
- Open Access
A Randomized Distributed Kaczmarz Algorithm and Anomaly Detection
The Kaczmarz algorithm is an iterative method for solving systems of linear equations. We introduce a randomized Kaczmarz algorithm for solving systems of linear equations in a distributed environment, i.e., the equations within the system are distributed over multiple nodes within a network. The modification we introduce is designed for a network with a tree structure that allows for passage of solution estimates between the nodes in the network. We demonstrate that the algorithm converges to the solution, or the solution of minimal norm, when the system is consistent. We also prove convergence rates of the randomized algorithm that depend on the spectral data of the coefficient matrix and the random control probability distribution. In addition, we demonstrate that the randomized algorithm can be used to identify anomalies in the system of equations when the measurements are perturbed by large, sparse noise.
Open AccessA Randomized Distributed Kaczmarz Algorithm and Anomaly Detection
The Kaczmarz algorithm is an iterative method for solving systems of linear equations. We introduce a randomized Kaczmarz algorithm for solving systems of linear equations in a distributed environment, i.e., the equations within the system are distributed over multiple nodes within a network. The modification we introduce is designed for a network with a tree structure that allows for passage of solution estimates between the nodes in the network. We demonstrate that the algorithm converges to the solution, or the solution of minimal norm, when the system is consistent. We also prove convergence rates of the randomized algorithm that depend on the spectral data of the coefficient matrix and the random control probability distribution. In addition, we demonstrate that the randomized algorithm can be used to identify anomalies in the system of equations when the measurements are perturbed by large, sparse noise.
- Open Access
Design of a Simple Orthogonal Multiwavelet Filter by Matrix Spectral Factorization
We consider the design of an orthogonal symmetric/antisymmetric multiwavelet from its matrix product filter by matrix spectral factorization (MSF). As a test problem, we construct a simple matrix product filter with desirable properties, and factor it using Bauer's method, which in this case can be done in closed form. The corresponding orthogonal multiwavelet function is derived using algebraic techniques which allow symmetry to be considered. This leads to the known orthogonal multiwavelet SA1, which can also be derived directly. We also give a lifting scheme for SA1, investigate the influence of the number of significant digits in the calculations, and show some numerical experiments.
Open AccessDesign of a Simple Orthogonal Multiwavelet Filter by Matrix Spectral Factorization
We consider the design of an orthogonal symmetric/antisymmetric multiwavelet from its matrix product filter by matrix spectral factorization (MSF). As a test problem, we construct a simple matrix product filter with desirable properties, and factor it using Bauer's method, which in this case can be done in closed form. The corresponding orthogonal multiwavelet function is derived using algebraic techniques which allow symmetry to be considered. This leads to the known orthogonal multiwavelet SA1, which can also be derived directly. We also give a lifting scheme for SA1, investigate the influence of the number of significant digits in the calculations, and show some numerical experiments.
- Open Access
Matrix Spectral Factorization for SA4 Multiwavelet
In this paper, we investigate Bauer's method for the matrix spectral factorization of an r-channel matrix product filter which is a halfband autocorrelation matrix. We regularize the resulting matrix spectral factors by an averaging approach and by multiplication by a unitary matrix. This leads to the approximate and exact orthogonal SA4 multiscaling functions. We also find the corresponding orthogonal multiwavelet functions, based on the QR decomposition.
Open AccessMatrix Spectral Factorization for SA4 Multiwavelet
In this paper, we investigate Bauer's method for the matrix spectral factorization of an r-channel matrix product filter which is a halfband autocorrelation matrix. We regularize the resulting matrix spectral factors by an averaging approach and by multiplication by a unitary matrix. This leads to the approximate and exact orthogonal SA4 multiscaling functions. We also find the corresponding orthogonal multiwavelet functions, based on the QR decomposition.
- 22 August 2020
- Published by Springer Nature
- p. 583-591
Biorthogonal Boundary Multiwavelets
- 27 August 2019
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 39 (4) , 2006-2041
Design of a Simple Orthogonal Multiwavelet Filter by Matrix Spectral Factorization
- 27 August 2019
- Published by Springer Nature in Circuits, Systems, and Signal Processing
- Vol. 39 (4) , 2006-2041
Design of a Simple Orthogonal Multiwavelet Filter by Matrix Spectral Factorization
- Open Access
A Kaczmarz Algorithm for Solving Tree Based Distributed Systems of Equations
The Kaczmarz algorithm is an iterative method for solving systems of linear equations. We introduce a modified Kaczmarz algorithm for solving systems of linear equations in a distributed environment, i.e. the equations within the system are distributed over multiple nodes within a network. The modification we introduce is designed for a network with a tree structure that allows for passage of solution estimates between the nodes in the network. We prove that the modified algorithm converges under no additional assumptions on the equations. We demonstrate that the algorithm converges to the solution, or the solution of minimal norm, when the system is consistent. We also demonstrate that in the case of an inconsistent system of equations, the modified relaxed Kaczmarz algorithm converges to a weighted least squares solution as the relaxation parameter approaches $0$.Open AccessA Kaczmarz Algorithm for Solving Tree Based Distributed Systems of Equations
The Kaczmarz algorithm is an iterative method for solving systems of linear equations. We introduce a modified Kaczmarz algorithm for solving systems of linear equations in a distributed environment, i.e. the equations within the system are distributed over multiple nodes within a network. The modification we introduce is designed for a network with a tree structure that allows for passage of solution estimates between the nodes in the network. We prove that the modified algorithm converges under no additional assumptions on the equations. We demonstrate that the algorithm converges to the solution, or the solution of minimal norm, when the system is consistent. We also demonstrate that in the case of an inconsistent system of equations, the modified relaxed Kaczmarz algorithm converges to a weighted least squares solution as the relaxation parameter approaches $0$. - 1 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 28 (6) , 2785-2798
A Robust Group-Sparse Representation Variational Method With Applications to Face Recognition
In this paper, we propose a Group-Sparse Representation-based method with applications to Face Recognition (GSR-FR). The novel sparse representation variational model includes a non-convex sparsity-inducing penalty and a robust non-convex loss function. The penalty encourages group sparsity by using an approximation of the ℓ 0 -quasinorm, and the loss function is chosen to make the algorithm robust to noise, occlusions, and disguises. The solution of the nontrivial non-convex optimization problem is efficiently obtained by a majorization-minimization strategy combined with forward-backward splitting, which, in particular, reduces the solution to a sequence of easier convex optimization sub-problems. Extensive experiments on widely used face databases show the potentiality of the proposed model and demonstrate that the GSR-FR algorithm is competitive with the state-of-the-art methods based on sparse representation, especially for very low dimensional feature spaces.
- 1 January 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 28 (6) , 2785-2798
A Robust Group-Sparse Representation Variational Method With Applications to Face Recognition
In this paper, we propose a Group-Sparse Representation-based method with applications to Face Recognition (GSR-FR). The novel sparse representation variational model includes a non-convex sparsity-inducing penalty and a robust non-convex loss function. The penalty encourages group sparsity by using an approximation of the ℓ 0 -quasinorm, and the loss function is chosen to make the algorithm robust to noise, occlusions, and disguises. The solution of the nontrivial non-convex optimization problem is efficiently obtained by a majorization-minimization strategy combined with forward-backward splitting, which, in particular, reduces the solution to a sequence of easier convex optimization sub-problems. Extensive experiments on widely used face databases show the potentiality of the proposed model and demonstrate that the GSR-FR algorithm is competitive with the state-of-the-art methods based on sparse representation, especially for very low dimensional feature spaces.