generalized_schur_move.hpp

Go to the documentation of this file.

 
//
// Copyright (c) 2025, University of Colorado Denver. All rights reserved.
//
// This file is part of <T>LAPACK.
// <T>LAPACK is free software: you can redistribute it and/or modify it under
// the terms of the BSD 3-Clause license. See the accompanying LICENSE file.
 
#ifndef TLAPACK_GENERALIZED_SCHUR_MOVE_HH
#define TLAPACK_GENERALIZED_SCHUR_MOVE_HH
 
#include "tlapack/base/utils.hpp"
#include "tlapack/lapack/generalized_schur_swap.hpp"
 
namespace tlapack {
 
template <TLAPACK_MATRIX matrix_t>
int generalized_schur_move(bool want_q,
                           bool want_z,
                           matrix_t& A,
                           matrix_t& B,
                           matrix_t& Q,
                           matrix_t& Z,
                           size_type<matrix_t>& ifst,
                           size_type<matrix_t>& ilst)
{
    using idx_t = size_type<matrix_t>;
    using T = type_t<matrix_t>;
    using real_t = real_type<T>;
 
    const idx_t n = ncols(A);
    const real_t zero(0);
 
    // Quick return
    if (n == 0) return 0;
 
    // Check if ifst points to the middle of a 2x2 block
    if (is_real<T>)
        if (ifst > 0)
            if (A(ifst, ifst - 1) != zero) ifst = ifst - 1;
 
    // Size of the current block, can be either 1, 2
    idx_t nbf = 1;
    if (is_real<T>)
        if (ifst < n - 1)
            if (A(ifst + 1, ifst) != zero) nbf = 2;
 
    // Check if ilst points to the middle of a 2x2 block
    if (is_real<T>)
        if (ilst > 0)
            if (A(ilst, ilst - 1) != zero) ilst = ilst - 1;
 
    // Size of the final block, can be either 1, 2
    idx_t nbl = 1;
    if (is_real<T>)
        if (ilst < n - 1)
            if (A(ilst + 1, ilst) != zero) nbl = 2;
 
    idx_t here = ifst;
    if (ifst < ilst) {
        if (nbf == 2 and nbl == 1) ilst = ilst - 1;
        if (nbf == 1 and nbl == 2) ilst = ilst + 1;
 
        while (here != ilst) {
            // Size of the next eigenvalue block
            idx_t nbnext = 1;
            if (is_real<T>)
                if (here + nbf + 1 < n)
                    if (A(here + nbf + 1, here + nbf) != zero) nbnext = 2;
 
            int ierr = generalized_schur_swap(want_q, want_z, A, B, Q, Z, here,
                                              nbf, nbnext);
            if (ierr) {
                // The swap failed, return with error
                ilst = here;
                return 1;
            }
            here = here + nbnext;
        }
    }
    else {
        while (here != ilst) {
            // Size of the next eigenvalue block
            idx_t nbnext = 1;
            if (is_real<T>)
                if (here > 1)
                    if (A(here - 1, here - 2) != zero) nbnext = 2;
 
            int ierr = generalized_schur_swap(want_q, want_z, A, B, Q, Z,
                                              here - nbnext, nbnext, nbf);
            if (ierr) {
                // The swap failed, return with error
                ilst = here;
                return 1;
            }
            here = here - nbnext;
        }
    }
 
    return 0;
}
 
}  // namespace tlapack
 
#endif  // TLAPACK_GENERALIZED_SCHUR_MOVE_HH