Public Member Functions
subroutine	la_ssolve_constrained_lstsq (a, b, c, d, x, storage, overwrite_matrices, err)
	Solve the real(sp) equality-constrained least-squares problem into x.

subroutine	la_dsolve_constrained_lstsq (a, b, c, d, x, storage, overwrite_matrices, err)
	Solve the real(dp) equality-constrained least-squares problem into x.

subroutine	la_qsolve_constrained_lstsq (a, b, c, d, x, storage, overwrite_matrices, err)
	Solve the real(qp) equality-constrained least-squares problem into x.

subroutine	la_csolve_constrained_lstsq (a, b, c, d, x, storage, overwrite_matrices, err)
	Solve the complex(sp) equality-constrained least-squares problem into x.

subroutine	la_zsolve_constrained_lstsq (a, b, c, d, x, storage, overwrite_matrices, err)
	Solve the complex(dp) equality-constrained least-squares problem into x.

subroutine	la_wsolve_constrained_lstsq (a, b, c, d, x, storage, overwrite_matrices, err)
	Solve the complex(qp) equality-constrained least-squares problem into x.

Member Function/Subroutine Documentation

◆ la_csolve_constrained_lstsq()

subroutine la_least_squares::solve_constrained_lstsq::la_csolve_constrained_lstsq	(	complex(sp), dimension(:,:), intent(inout), target	a,
		complex(sp), dimension(:), intent(inout), target	b,
		complex(sp), dimension(:,:), intent(inout), target	c,
		complex(sp), dimension(:), intent(inout), target	d,
		complex(sp), dimension(:), intent(out)	x,
		complex(sp), dimension(:), intent(out), optional, target	storage,
		logical(lk), intent(in), optional	overwrite_matrices,
		type(la_state), intent(out), optional	err )

Solve the complex(sp) equality-constrained least-squares problem into x.

Parameters

[in,out]	a	Least-squares matrix a[m,n] and right hand side b[m]
[in,out]	b	Least-squares matrix a[m,n] and right hand side b[m]
[in,out]	c	Equality constraint matrix c[p,n] and right hand side d[p]
[in,out]	d	Equality constraint matrix c[p,n] and right hand side d[p]
[out]	x	Solution vector x[n]
[out]	storage	[optional] working storage space
[in]	overwrite_matrices	[optional] Can A,b,C,d data be overwritten and destroyed?
[out]	err	[optional] state return flag. On error if not requested, the code will stop

subroutine la_least_squares::solve_constrained_lstsq::la_dsolve_constrained_lstsq	(	real(dp), dimension(:,:), intent(inout), target	a,
		real(dp), dimension(:), intent(inout), target	b,
		real(dp), dimension(:,:), intent(inout), target	c,
		real(dp), dimension(:), intent(inout), target	d,
		real(dp), dimension(:), intent(out)	x,
		real(dp), dimension(:), intent(out), optional, target	storage,
		logical(lk), intent(in), optional	overwrite_matrices,
		type(la_state), intent(out), optional	err )

Solve the real(dp) equality-constrained least-squares problem into x.

Parameters

[in,out]	a	Least-squares matrix a[m,n] and right hand side b[m]
[in,out]	b	Least-squares matrix a[m,n] and right hand side b[m]
[in,out]	c	Equality constraint matrix c[p,n] and right hand side d[p]
[in,out]	d	Equality constraint matrix c[p,n] and right hand side d[p]
[out]	x	Solution vector x[n]
[out]	storage	[optional] working storage space
[in]	overwrite_matrices	[optional] Can A,b,C,d data be overwritten and destroyed?
[out]	err	[optional] state return flag. On error if not requested, the code will stop

subroutine la_least_squares::solve_constrained_lstsq::la_qsolve_constrained_lstsq	(	real(qp), dimension(:,:), intent(inout), target	a,
		real(qp), dimension(:), intent(inout), target	b,
		real(qp), dimension(:,:), intent(inout), target	c,
		real(qp), dimension(:), intent(inout), target	d,
		real(qp), dimension(:), intent(out)	x,
		real(qp), dimension(:), intent(out), optional, target	storage,
		logical(lk), intent(in), optional	overwrite_matrices,
		type(la_state), intent(out), optional	err )

Solve the real(qp) equality-constrained least-squares problem into x.

Parameters

[in,out]	a	Least-squares matrix a[m,n] and right hand side b[m]
[in,out]	b	Least-squares matrix a[m,n] and right hand side b[m]
[in,out]	c	Equality constraint matrix c[p,n] and right hand side d[p]
[in,out]	d	Equality constraint matrix c[p,n] and right hand side d[p]
[out]	x	Solution vector x[n]
[out]	storage	[optional] working storage space
[in]	overwrite_matrices	[optional] Can A,b,C,d data be overwritten and destroyed?
[out]	err	[optional] state return flag. On error if not requested, the code will stop

subroutine la_least_squares::solve_constrained_lstsq::la_ssolve_constrained_lstsq	(	real(sp), dimension(:,:), intent(inout), target	a,
		real(sp), dimension(:), intent(inout), target	b,
		real(sp), dimension(:,:), intent(inout), target	c,
		real(sp), dimension(:), intent(inout), target	d,
		real(sp), dimension(:), intent(out)	x,
		real(sp), dimension(:), intent(out), optional, target	storage,
		logical(lk), intent(in), optional	overwrite_matrices,
		type(la_state), intent(out), optional	err )

Solve the real(sp) equality-constrained least-squares problem into x.

Parameters

[in,out]	a	Least-squares matrix a[m,n] and right hand side b[m]
[in,out]	b	Least-squares matrix a[m,n] and right hand side b[m]
[in,out]	c	Equality constraint matrix c[p,n] and right hand side d[p]
[in,out]	d	Equality constraint matrix c[p,n] and right hand side d[p]
[out]	x	Solution vector x[n]
[out]	storage	[optional] working storage space
[in]	overwrite_matrices	[optional] Can A,b,C,d data be overwritten and destroyed?
[out]	err	[optional] state return flag. On error if not requested, the code will stop

subroutine la_least_squares::solve_constrained_lstsq::la_wsolve_constrained_lstsq	(	complex(qp), dimension(:,:), intent(inout), target	a,
		complex(qp), dimension(:), intent(inout), target	b,
		complex(qp), dimension(:,:), intent(inout), target	c,
		complex(qp), dimension(:), intent(inout), target	d,
		complex(qp), dimension(:), intent(out)	x,
		complex(qp), dimension(:), intent(out), optional, target	storage,
		logical(lk), intent(in), optional	overwrite_matrices,
		type(la_state), intent(out), optional	err )

Solve the complex(qp) equality-constrained least-squares problem into x.

Parameters

[in,out]	a	Least-squares matrix a[m,n] and right hand side b[m]
[in,out]	b	Least-squares matrix a[m,n] and right hand side b[m]
[in,out]	c	Equality constraint matrix c[p,n] and right hand side d[p]
[in,out]	d	Equality constraint matrix c[p,n] and right hand side d[p]
[out]	x	Solution vector x[n]
[out]	storage	[optional] working storage space
[in]	overwrite_matrices	[optional] Can A,b,C,d data be overwritten and destroyed?
[out]	err	[optional] state return flag. On error if not requested, the code will stop

subroutine la_least_squares::solve_constrained_lstsq::la_zsolve_constrained_lstsq	(	complex(dp), dimension(:,:), intent(inout), target	a,
		complex(dp), dimension(:), intent(inout), target	b,
		complex(dp), dimension(:,:), intent(inout), target	c,
		complex(dp), dimension(:), intent(inout), target	d,
		complex(dp), dimension(:), intent(out)	x,
		complex(dp), dimension(:), intent(out), optional, target	storage,
		logical(lk), intent(in), optional	overwrite_matrices,
		type(la_state), intent(out), optional	err )

Solve the complex(dp) equality-constrained least-squares problem into x.

Parameters

[in,out]	a	Least-squares matrix a[m,n] and right hand side b[m]
[in,out]	b	Least-squares matrix a[m,n] and right hand side b[m]
[in,out]	c	Equality constraint matrix c[p,n] and right hand side d[p]
[in,out]	d	Equality constraint matrix c[p,n] and right hand side d[p]
[out]	x	Solution vector x[n]
[out]	storage	[optional] working storage space
[in]	overwrite_matrices	[optional] Can A,b,C,d data be overwritten and destroyed?
[out]	err	[optional] state return flag. On error if not requested, the code will stop

The documentation for this interface was generated from the following file: