LAED6: computes the positive or negative root (closest to the origin) of z(1) z(2) z(3) f(x) = rho + ------— + -------— + ------— d(1)-x d(2)-x d(3)-x It is assumed that if ORGATI = .true. the root is between d(2) and d(3); otherwise it is between d(1) and d(2) This routine will be called by DLAED4 when necessary. In most cases, the root sought is the smallest in magnitude, though it might not be in some extremely rare situations.
More...
|
pure subroutine | dlaed6 (kniter, orgati, rho, d, z, finit, tau, info) |
|
| la_dlaed6 |
|
| la_qlaed6 |
|
pure subroutine | slaed6 (kniter, orgati, rho, d, z, finit, tau, info) |
|
| la_slaed6 |
|
LAED6: computes the positive or negative root (closest to the origin) of z(1) z(2) z(3) f(x) = rho + ------— + -------— + ------— d(1)-x d(2)-x d(3)-x It is assumed that if ORGATI = .true. the root is between d(2) and d(3); otherwise it is between d(1) and d(2) This routine will be called by DLAED4 when necessary. In most cases, the root sought is the smallest in magnitude, though it might not be in some extremely rare situations.
◆ dlaed6()
pure subroutine la_lapack::laed6::dlaed6 |
( |
integer(ilp), intent(in) |
kniter, |
|
|
logical(lk), intent(in) |
orgati, |
|
|
real(dp), intent(in) |
rho, |
|
|
real(dp), dimension(3), intent(in) |
d, |
|
|
real(dp), dimension(3), intent(in) |
z, |
|
|
real(dp), intent(in) |
finit, |
|
|
real(dp), intent(out) |
tau, |
|
|
integer(ilp), intent(out) |
info |
|
) |
| |
◆ la_dlaed6()
la_lapack::laed6::la_dlaed6 |
◆ la_qlaed6()
la_lapack::laed6::la_qlaed6 |
◆ la_slaed6()
la_lapack::laed6::la_slaed6 |
◆ slaed6()
pure subroutine la_lapack::laed6::slaed6 |
( |
integer(ilp), intent(in) |
kniter, |
|
|
logical(lk), intent(in) |
orgati, |
|
|
real(sp), intent(in) |
rho, |
|
|
real(sp), dimension(3), intent(in) |
d, |
|
|
real(sp), dimension(3), intent(in) |
z, |
|
|
real(sp), intent(in) |
finit, |
|
|
real(sp), intent(out) |
tau, |
|
|
integer(ilp), intent(out) |
info |
|
) |
| |
The documentation for this interface was generated from the following file: