linalg
1.4.3
A linear algebra library that provides a user-friendly interface to several BLAS and LAPACK routines.
|
Data Types | |
interface | sort |
Sorts an array. More... | |
Functions/Subroutines | |
subroutine | sort_dbl_array (x, ascend) |
Sorts an array. More... | |
subroutine | sort_dbl_array_ind (x, ind, ascend, err) |
Sorts an array. More... | |
subroutine | sort_cmplx_array (x, ascend) |
Sorts an array. More... | |
subroutine | sort_cmplx_array_ind (x, ind, ascend, err) |
Sorts an array. More... | |
subroutine | sort_eigen_cmplx (vals, vecs, ascend, err) |
A sorting routine specifically tailored for sorting of eigenvalues and their associated eigenvectors using a quick-sort approach. More... | |
subroutine | sort_eigen_dbl (vals, vecs, ascend, err) |
A sorting routine specifically tailored for sorting of eigenvalues and their associated eigenvectors using a quick-sort approach. More... | |
recursive subroutine | qsort_dbl_ind (ascend, x, ind) |
A recursive quick sort algorithm. More... | |
subroutine | dbl_partition_ind (ascend, x, ind, marker) |
A routine to perform the partioning necessary for the quick sort algorithm. More... | |
recursive subroutine | qsort_cmplx (ascend, x) |
A recursive quick sort algorithm. More... | |
subroutine | cmplx_partition (ascend, x, marker) |
A routine to perform the partioning necessary for the quick sort algorithm. More... | |
recursive subroutine | qsort_cmplx_ind (ascend, x, ind) |
A recursive quick sort algorithm. More... | |
subroutine | cmplx_partition_ind (ascend, x, ind, marker) |
A routine to perform the partioning necessary for the quick sort algorithm. More... | |
|
private |
A routine to perform the partioning necessary for the quick sort algorithm.
[in] | ascend | Set to true to sort in ascending order; else, false to sort in descending order. |
[in,out] | x | On input, the array to sort. On output, the sorted array. |
[out] | marker | The partioning marker. |
Definition at line 579 of file linalg_sorting.f90.
|
private |
A routine to perform the partioning necessary for the quick sort algorithm.
[in] | ascend | Set to true to sort in ascending order; else, false to sort in descending order. |
[in,out] | x | On input, the array to sort. On output, the sorted array. |
[in,out] | ind | On input, a tracking array of the same length as x . On output, the same array, but shuffled to match the sorting order of x . |
[out] | marker | The partioning marker. |
Definition at line 704 of file linalg_sorting.f90.
|
private |
A routine to perform the partioning necessary for the quick sort algorithm.
[in] | ascend | Set to true to sort in ascending order; else, false to sort in descending order. |
[in,out] | x | On input, the array to sort. On output, the sorted array. |
[in,out] | ind | On input, a tracking array of the same length as x . On output, the same array, but shuffled to match the sorting order of x . |
[out] | marker | The partioning marker. |
Definition at line 453 of file linalg_sorting.f90.
|
private |
A recursive quick sort algorithm.
[in] | ascend | Set to true to sort in ascending order; else, false to sort in descending order. |
[in,out] | x | On input, the array to sort. On output, the sorted array. |
Definition at line 546 of file linalg_sorting.f90.
|
private |
A recursive quick sort algorithm.
[in] | ascend | Set to true to sort in ascending order; else, false to sort in descending order. |
[in,out] | x | On input, the array to sort. On output, the sorted array. |
[in,out] | ind | On input, a tracking array of the same length as x . On output, the same array, but shuffled to match the sorting order of x . |
Definition at line 667 of file linalg_sorting.f90.
|
private |
A recursive quick sort algorithm.
[in] | ascend | Set to true to sort in ascending order; else, false to sort in descending order. |
[in,out] | x | On input, the array to sort. On output, the sorted array. |
[in,out] | ind | On input, a tracking array of the same length as x . On output, the same array, but shuffled to match the sorting order of x . |
Definition at line 420 of file linalg_sorting.f90.
|
private |
Sorts an array.
[in,out] | x | On input, the array to sort. On output, the sorted array. |
[in] | ascend | An optional input that, if specified, controls if the the array is sorted in an ascending order (default), or a descending order. |
Definition at line 157 of file linalg_sorting.f90.
|
private |
Sorts an array.
[in,out] | x | On input, the array to sort. On output, the sorted array. |
[in,out] | ind | On input, an integer array. On output, the contents of this array are shifted in the same order as that of x as a means of tracking the sorting operation. It is often useful to set this array to an ascending group of values (1, 2, ... n) such that this array tracks the original positions of the sorted array. Such an array can then be used to align other arrays. This array must be the same size as x . |
[in] | ascend | An optional input that, if specified, controls if the the array is sorted in an ascending order (default), or a descending order. |
[out] | err | An optional errors-based object that if provided can be used to retrieve information relating to any errors encountered during execution. If not provided, a default implementation of the errors class is used internally to provide error handling. Possible errors and warning messages that may be encountered are as follows.
|
Definition at line 206 of file linalg_sorting.f90.
|
private |
Sorts an array.
[in,out] | x | On input, the array to sort. On output, the sorted array. |
[in] | ascend | An optional input that, if specified, controls if the the array is sorted in an ascending order (default), or a descending order. |
Definition at line 48 of file linalg_sorting.f90.
|
private |
Sorts an array.
[in,out] | x | On input, the array to sort. On output, the sorted array. |
[in,out] | ind | On input, an integer array. On output, the contents of this array are shifted in the same order as that of x as a means of tracking the sorting operation. It is often useful to set this array to an ascending group of values (1, 2, ... n) such that this array tracks the original positions of the sorted array. Such an array can then be used to align other arrays. This array must be the same size as x . |
[in] | ascend | An optional input that, if specified, controls if the the array is sorted in an ascending order (default), or a descending order. |
[out] | err | An optional errors-based object that if provided can be used to retrieve information relating to any errors encountered during execution. If not provided, a default implementation of the errors class is used internally to provide error handling. Possible errors and warning messages that may be encountered are as follows.
|
Definition at line 98 of file linalg_sorting.f90.
|
private |
A sorting routine specifically tailored for sorting of eigenvalues and their associated eigenvectors using a quick-sort approach.
[in,out] | vals | On input, an N-element array containing the eigenvalues. On output, the sorted eigenvalues. |
[in,out] | vecs | On input, an N-by-N matrix containing the eigenvectors associated with vals (one vector per column). On output, the sorted eigenvector matrix. |
[in] | ascend | An optional input that, if specified, controls if the the array is sorted in an ascending order (default), or a descending order. |
[out] | err | An optional errors-based object that if provided can be used to retrieve information relating to any errors encountered during execution. If not provided, a default implementation of the errors class is used internally to provide error handling. Possible errors and warning messages that may be encountered are as follows.
|
Definition at line 268 of file linalg_sorting.f90.
|
private |
A sorting routine specifically tailored for sorting of eigenvalues and their associated eigenvectors using a quick-sort approach.
[in,out] | vals | On input, an N-element array containing the eigenvalues. On output, the sorted eigenvalues. |
[in,out] | vecs | On input, an N-by-N matrix containing the eigenvectors associated with vals (one vector per column). On output, the sorted eigenvector matrix. |
[in] | ascend | An optional input that, if specified, controls if the the array is sorted in an ascending order (default), or a descending order. |
[out] | err | An optional errors-based object that if provided can be used to retrieve information relating to any errors encountered during execution. If not provided, a default implementation of the errors class is used internally to provide error handling. Possible errors and warning messages that may be encountered are as follows.
|
Definition at line 346 of file linalg_sorting.f90.