bl1_maxabsm.c File Reference

(r)

Functions
void	bl1_smaxabsm (int m, int n, float *a, int a_rs, int a_cs, float *maxabs)
void	bl1_dmaxabsm (int m, int n, double *a, int a_rs, int a_cs, double *maxabs)
void	bl1_cmaxabsm (int m, int n, scomplex *a, int a_rs, int a_cs, float *maxabs)
void	bl1_zmaxabsm (int m, int n, dcomplex *a, int a_rs, int a_cs, double *maxabs)

Function Documentation

bl1_cmaxabsm()

void bl1_cmaxabsm	(	int	m,
		int	n,
		scomplex *	a,
		int	a_rs,
		int	a_cs,
		float *	maxabs
	)

{
    float     zero = bl1_s0();
    scomplex* a_begin;
    float     maxabs_cand;
    float     maxabs_temp;
    int       inca, lda;
    int       n_iter;
    int       n_elem;
    int       j;
 
    // Return early if possible.
    if ( bl1_zero_dim2( m, n ) ) { *maxabs = zero; return; }
 
    // Initialize with optimal values for column-major storage.
    inca   = a_rs;
    lda    = a_cs;
    n_iter = n;
    n_elem = m;
 
    // An optimization: if A is row-major, then let's access the matrix by
    // rows instead of by columns for increased spatial locality.
    if ( bl1_is_row_storage( a_rs, a_cs ) )
    {
        bl1_swap_ints( n_iter, n_elem );
        bl1_swap_ints( lda, inca );
    }
 
    // Initialize the maximum absolute value candidate to the first element.
    bl1_csabsval2( a, &maxabs_cand );
 
    for ( j = 0; j < n_iter; j++ )
    {
        a_begin = a + j*lda;
 
        bl1_cmaxabsv( n_elem,
                      a_begin, inca,
                      &maxabs_temp );
 
        if ( maxabs_temp > maxabs_cand ) maxabs_cand = maxabs_temp;
    }
 
    *maxabs = maxabs_cand;
}

References bl1_cmaxabsv(), bl1_is_row_storage(), bl1_s0(), and bl1_zero_dim2().

Referenced by FLA_Max_abs_value().

bl1_dmaxabsm()

void bl1_dmaxabsm	(	int	m,
		int	n,
		double *	a,
		int	a_rs,
		int	a_cs,
		double *	maxabs
	)

{
    double    zero = bl1_d0();
    double*   a_begin;
    double    maxabs_cand;
    double    maxabs_temp;
    int       inca, lda;
    int       n_iter;
    int       n_elem;
    int       j;
 
    // Return early if possible.
    if ( bl1_zero_dim2( m, n ) ) { *maxabs = zero; return; }
 
    // Initialize with optimal values for column-major storage.
    inca   = a_rs;
    lda    = a_cs;
    n_iter = n;
    n_elem = m;
 
    // An optimization: if A is row-major, then let's access the matrix by
    // rows instead of by columns for increased spatial locality.
    if ( bl1_is_row_storage( a_rs, a_cs ) )
    {
        bl1_swap_ints( n_iter, n_elem );
        bl1_swap_ints( lda, inca );
    }
 
    // Initialize the maximum absolute value candidate to the first element.
    bl1_dabsval2( a, &maxabs_cand );
 
    for ( j = 0; j < n_iter; j++ )
    {
        a_begin = a + j*lda;
 
        bl1_dmaxabsv( n_elem,
                      a_begin, inca,
                      &maxabs_temp );
 
        if ( maxabs_temp > maxabs_cand ) maxabs_cand = maxabs_temp;
    }
 
    *maxabs = maxabs_cand;
}

References bl1_d0(), bl1_dmaxabsv(), bl1_is_row_storage(), and bl1_zero_dim2().

Referenced by FLA_Max_abs_value().

bl1_smaxabsm()

void bl1_smaxabsm	(	int	m,
		int	n,
		float *	a,
		int	a_rs,
		int	a_cs,
		float *	maxabs
	)

{
    float     zero = bl1_s0();
    float*    a_begin;
    float     maxabs_cand;
    float     maxabs_temp;
    int       inca, lda;
    int       n_iter;
    int       n_elem;
    int       j;
 
    // Return early if possible.
    if ( bl1_zero_dim2( m, n ) ) { *maxabs = zero; return; }
 
    // Initialize with optimal values for column-major storage.
    inca   = a_rs;
    lda    = a_cs;
    n_iter = n;
    n_elem = m;
 
    // An optimization: if A is row-major, then let's access the matrix by
    // rows instead of by columns for increased spatial locality.
    if ( bl1_is_row_storage( a_rs, a_cs ) )
    {
        bl1_swap_ints( n_iter, n_elem );
        bl1_swap_ints( lda, inca );
    }
 
    // Initialize the maximum absolute value candidate to the first element.
    bl1_sabsval2( a, &maxabs_cand );
 
    for ( j = 0; j < n_iter; j++ )
    {
        a_begin = a + j*lda;
 
        bl1_smaxabsv( n_elem,
                      a_begin, inca,
                      &maxabs_temp );
 
        if ( maxabs_temp > maxabs_cand ) maxabs_cand = maxabs_temp;
    }
 
    *maxabs = maxabs_cand;
}

References bl1_is_row_storage(), bl1_s0(), bl1_smaxabsv(), and bl1_zero_dim2().

Referenced by FLA_Max_abs_value().

bl1_zmaxabsm()

void bl1_zmaxabsm	(	int	m,
		int	n,
		dcomplex *	a,
		int	a_rs,
		int	a_cs,
		double *	maxabs
	)

{
    double    zero = bl1_d0();
    dcomplex* a_begin;
    double    maxabs_cand;
    double    maxabs_temp;
    int       inca, lda;
    int       n_iter;
    int       n_elem;
    int       j;
 
    // Return early if possible.
    if ( bl1_zero_dim2( m, n ) ) { *maxabs = zero; return; }
 
    // Initialize with optimal values for column-major storage.
    inca   = a_rs;
    lda    = a_cs;
    n_iter = n;
    n_elem = m;
 
    // An optimization: if A is row-major, then let's access the matrix by
    // rows instead of by columns for increased spatial locality.
    if ( bl1_is_row_storage( a_rs, a_cs ) )
    {
        bl1_swap_ints( n_iter, n_elem );
        bl1_swap_ints( lda, inca );
    }
 
    // Initialize the maximum absolute value candidate to the first element.
    bl1_zdabsval2( a, &maxabs_cand );
 
    for ( j = 0; j < n_iter; j++ )
    {
        a_begin = a + j*lda;
 
        bl1_zmaxabsv( n_elem,
                      a_begin, inca,
                      &maxabs_temp );
 
        if ( maxabs_temp > maxabs_cand ) maxabs_cand = maxabs_temp;
    }
 
    *maxabs = maxabs_cand;
}

References bl1_d0(), bl1_is_row_storage(), bl1_zero_dim2(), and bl1_zmaxabsv().

Referenced by FLA_Max_abs_value().