mirror of
https://gitlab.com/scemama/QCaml.git
synced 2024-10-31 19:23:40 +01:00
164 lines
4.6 KiB
OCaml
164 lines
4.6 KiB
OCaml
(** All utilities which should be included in all source files are defined here *)
|
|
|
|
(** {2 Functions from libm} *)
|
|
|
|
external erf_float : float -> float = "erf_float_bytecode" "erf_float"
|
|
[@@unboxed] [@@noalloc]
|
|
(** Error function [erf] from [libm] *)
|
|
|
|
external erfc_float : float -> float = "erfc_float_bytecode" "erfc_float"
|
|
[@@unboxed] [@@noalloc]
|
|
(** Complementary error function [erfc] from [libm] *)
|
|
|
|
external gamma_float : float -> float = "gamma_float_bytecode" "gamma_float"
|
|
[@@unboxed] [@@noalloc]
|
|
(** Gamma function [gamma] from [libm] *)
|
|
|
|
|
|
|
|
(** {2 General functions} *)
|
|
|
|
val fact : int -> float
|
|
(** Factorial function.
|
|
@raise Invalid_argument for negative arguments or arguments >100.
|
|
*)
|
|
|
|
val binom : int -> int -> int
|
|
(** Binomial coefficient. [binom n k] {% $= C_n^k$ %}. *)
|
|
|
|
val pow : float -> int -> float
|
|
(** Fast implementation of the power function for small integer powers *)
|
|
|
|
val chop : float -> (unit -> float) -> float
|
|
(** In [chop a f], evaluate [f] only if the absolute value of [a] is larger
|
|
than {!Constants.epsilon}, and return [a *. f ()].
|
|
*)
|
|
|
|
|
|
|
|
(** {2 Functions related to the Boys function} *)
|
|
|
|
val incomplete_gamma : alpha:float -> float -> float
|
|
(** {{:https://en.wikipedia.org/wiki/Incomplete_gamma_function}
|
|
Lower incomplete gamma function}
|
|
@raise Failure when the calculation doesn't converge.
|
|
*)
|
|
|
|
val boys_function : maxm:int -> float -> float array
|
|
(** {{:https://link.springer.com/article/10.1007/s10910-005-9023-3}
|
|
Generalized Boys function}.
|
|
@param maxm Maximum total angular momentum.
|
|
*)
|
|
|
|
|
|
(** {2 Extension of the Array module} *)
|
|
|
|
val array_sum : float array -> float
|
|
(** Returns the sum of all the elements of the array *)
|
|
|
|
val array_product : float array -> float
|
|
(** Returns the product of all the elements of the array *)
|
|
|
|
|
|
(** {2 Extension of the List module} *)
|
|
|
|
val list_some : 'a option list -> 'a list
|
|
(** Filters out all [None] elements of the list, and returns the elements without
|
|
the [Some]. *)
|
|
|
|
val list_range : int -> int -> int list
|
|
(** [list_range first last] returns a list [first; first+1 ; ... ; last-1 ; last ]. *)
|
|
|
|
(** {2 Useful streams} *)
|
|
val stream_range : int -> int -> int Stream.t
|
|
(** [stream_range first last] returns a stream <first ; first+1 ; ... ; last-1 ; last>. *)
|
|
|
|
|
|
(** {2 Linear algebra } *)
|
|
|
|
val diagonalize_symm : Lacaml.D.mat -> Lacaml.D.mat * Lacaml.D.vec
|
|
(** Diagonalize a symmetric matrix. Returns the eigenvectors and the eigenvalues. *)
|
|
|
|
val xt_o_x : o:Lacaml.D.mat -> x:Lacaml.D.mat -> Lacaml.D.mat
|
|
(** Computes {% $\mathbf{X^\dag\, O\, X}$ %} *)
|
|
|
|
val canonical_ortho: ?thresh:float -> overlap:Lacaml.D.mat -> Lacaml.D.mat -> Lacaml.D.mat
|
|
(** Canonical orthogonalization. [overlap] is the overlap matrix {% $\mathbf{S}$ %},
|
|
and the last argument contains the vectors {% $\mathbf{C}$ %} to orthogonalize.
|
|
|
|
{%
|
|
$$
|
|
\mathbf{C_\bot} = \mathbf{C\, U\, D^{-1/2}}, \;
|
|
\mathbf{U\, D\, V^\dag} = \mathbf{S}
|
|
$$
|
|
%}
|
|
|
|
*)
|
|
|
|
val debug_matrix: string -> Lacaml.D.mat -> unit
|
|
(** Prints a matrix in stdout for debug *)
|
|
|
|
val matrix_of_file : string -> Lacaml.D.mat
|
|
(** Reads a matrix from a file with format "%d %d %f" corresponding to
|
|
[i, j, A.{i,j}]. *)
|
|
|
|
val sym_matrix_of_file : string -> Lacaml.D.mat
|
|
(** Reads a symmetric matrix from a file with format "%d %d %f" corresponding to
|
|
[i, j, A.{i,j}]. *)
|
|
|
|
|
|
(** {2 Bitstring functions} *)
|
|
|
|
val bit_permtutations : int -> int -> Z.t list
|
|
(** [bit_permtutations m n] generates the list of all possible [n]-bit
|
|
strings with [m] bits set to 1.
|
|
Algorithm adapted from
|
|
{{:https://graphics.stanford.edu/~seander/bithacks.html#NextBitPermutation}
|
|
Bit twiddling hacks}.
|
|
Example:
|
|
{[
|
|
bit_permtutations 2 4 = [ 0011 ; 0101 ; 0110 ; 1001 ; 1010 ; 1100 ]
|
|
]}
|
|
*)
|
|
|
|
|
|
(** {2 Printers} *)
|
|
val pp_float_array_size : Format.formatter -> float array -> unit
|
|
(** Example:
|
|
{[
|
|
[ 6: 1.000000 1.732051 1.732051 1.000000 1.732051 1.000000
|
|
]
|
|
]}
|
|
*)
|
|
|
|
val pp_float_array : Format.formatter -> float array -> unit
|
|
(** Example:
|
|
{[
|
|
[ 1.000000 1.732051 1.732051 1.000000 1.732051 1.000000
|
|
]
|
|
]}
|
|
*)
|
|
|
|
val pp_float_2darray_size : Format.formatter -> float array array -> unit
|
|
(** Example:
|
|
{[
|
|
[
|
|
2:[ 6: 1.000000 1.732051 1.732051 1.000000 1.732051 1.000000 ]
|
|
[ 4: 1.000000 2.000000 3.000000 4.000000 ] ]
|
|
]}
|
|
*)
|
|
|
|
val pp_float_2darray : Format.formatter -> float array array -> unit
|
|
(** Example:
|
|
{[
|
|
[ [ 1.000000 1.732051 1.732051 1.000000 1.732051 1.000000 ]
|
|
[ 1.000000 2.000000 3.000000 4.000000 ] ]
|
|
]}
|
|
*)
|
|
|
|
val pp_bitstring : int -> Format.formatter -> Z.t -> unit
|
|
(** Example: [ pp_bitstring 14 ppf z -> +++++------+-- ] *)
|
|
|
|
val pp_matrix : Format.formatter -> Lacaml.D.mat -> unit
|
|
|