Function Vector Methods

• Function vector methods are mathematical techniques that treat functions as vectors in Hilbert spaces, enabling operator formulations, orthogonal projections, and spectral analysis.
• They facilitate computational strategies such as precomputed inversion, rational approximations, and Fourier-based transforms to efficiently evaluate and optimize complex function representations.
• These methods extend to distributed and secure computation, supporting advanced applications in MIMO systems, vector network coding, and multi-dimensional optimization.

Function vector methods comprise several technically distinct constructions in which functions are represented, transformed, inverted, optimized, or computed through vectorial structures. In the literature considered here, the term covers Hilbert-space operator methods that treat functions as vectors and equations as $A x=b$, precomputed “function-vector” or “rank-support” schemes for rapid nonlinear inversion, realizations of free vector lattices as lattices of positively homogeneous functions, transform operators for piecewise harmonic boundary-value problems, algorithms for evaluating functions of matrices or multivectors, first-order methods for vector optimization, and distributed schemes for computing vector functions over networks and multiple-access channels (Burrus, 2019, Arnas et al., 2020, Jeu, 2020, Blanes, 2022, Chappell et al., 2014, Chen et al., 2024, Xu et al., 7 Feb 2026, Razavikia et al., 4 Nov 2025).

1. Operator formulations and functions as vectors

A foundational usage of function vector methods arises in signal and system theory, where a real or complex vector space of functions $\mathcal H$ is endowed with an inner product such as

$$\langle f,g\rangle=\int_T f(t)\,\overline{g(t)}\,dt,$$

with induced norm $\|f\|=\sqrt{\langle f,f\rangle}$. When complete in the induced metric, $\mathcal H$ is a Hilbert space; examples include $L^2(T)$ and $\ell^2$. In this setting, functions $x\in\mathcal X$ and $b\in\mathcal Y$ are treated as abstract vectors, while $A:\mathcal X\to\mathcal Y$ is a linear operator, so that $\mathcal H$0 covers integral equations and convolutions. The adjoint $\mathcal H$1 is defined by $\mathcal H$2, orthonormal bases yield expansions $\mathcal H$3 with $\mathcal H$4, and Parseval’s identity gives $\mathcal H$5 (Burrus, 2019).

This perspective leads directly to projection methods. When $\mathcal H$6, the least-squares solution minimizes $\mathcal H$7 subject to $\mathcal H$8, which yields the normal equations

$\mathcal H$9

If $$\langle f,g\rangle=\int_T f(t)\,\overline{g(t)}\,dt,$$0 is invertible, the minimizer is $$\langle f,g\rangle=\int_T f(t)\,\overline{g(t)}\,dt,$$1. In general, the Moore–Penrose pseudoinverse $$\langle f,g\rangle=\int_T f(t)\,\overline{g(t)}\,dt,$$2 gives the least-squares, minimum-norm solution $$\langle f,g\rangle=\int_T f(t)\,\overline{g(t)}\,dt,$$3, and under an SVD

$$\langle f,g\rangle=\int_T f(t)\,\overline{g(t)}\,dt,$$4

one has

$$\langle f,g\rangle=\int_T f(t)\,\overline{g(t)}\,dt,$$5

The same framework extends to compact operators on infinite-dimensional Hilbert spaces and underlies approximation, optimization, filter design, deconvolution, and parameter identification (Burrus, 2019).

In this operator-theoretic sense, “function vector” denotes not a specialized data structure but a change of viewpoint: functions are embedded into linear spaces where orthogonality, projection, basis expansion, and spectral factorization become available. This suggests a broad methodological core shared by otherwise disparate areas.

2. Function lattices and vector-valued representation theory

A second major line of work studies spaces of functions as concrete realizations of abstract ordered structures. For a real vector space $$\langle f,g\rangle=\int_T f(t)\,\overline{g(t)}\,dt,$$6, the free vector lattice $$\langle f,g\rangle=\int_T f(t)\,\overline{g(t)}\,dt,$$7 can be realized canonically as a vector lattice of real-valued positively homogeneous functions on any linear subspace $$\langle f,g\rangle=\int_T f(t)\,\overline{g(t)}\,dt,$$8 of the algebraic dual that separates points. The construction starts from the evaluation map

$$\langle f,g\rangle=\int_T f(t)\,\overline{g(t)}\,dt,$$9

and the vector sublattice $\|f\|=\sqrt{\langle f,f\rangle}$0 generated by $\|f\|=\sqrt{\langle f,f\rangle}$1, where $\|f\|=\sqrt{\langle f,f\rangle}$2 denotes positively homogeneous functions on $\|f\|=\sqrt{\langle f,f\rangle}$3 with pointwise lattice operations. The main theorem states that the unique extension $\|f\|=\sqrt{\langle f,f\rangle}$4 is injective, its range is exactly $\|f\|=\sqrt{\langle f,f\rangle}$5, and hence $\|f\|=\sqrt{\langle f,f\rangle}$6 is vector-lattice isomorphic to $\|f\|=\sqrt{\langle f,f\rangle}$7 (Jeu, 2020).

This realization has several specializations. If $\|f\|=\sqrt{\langle f,f\rangle}$8 is a Banach space and $\|f\|=\sqrt{\langle f,f\rangle}$9, the norm dual, the same construction recovers the usual free Banach lattice over $\mathcal H$0 as a Banach lattice of positively homogeneous functions on $\mathcal H$1. If $\mathcal H$2 is the free vector space on a set $\mathcal H$3, one may choose a smaller separating subspace than the full dual, and for infinite $\mathcal H$4 this yields concrete models on spaces strictly smaller than the naive $\mathcal H$5 (Jeu, 2020).

Related questions arise for subspaces $\mathcal H$6 of vector-valued continuous functions. Two distinct representation theories are available. One represents functionals in $\mathcal H$7 by $\mathcal H$8-valued vector measures on $\mathcal H$9 via the Singer integral, while the other represents some operators in $L^2(T)$0 by scalar Radon measures on $L^2(T)$1 via the Bochner integral. These lead to two distinct notions: vector simpliciality and weak simpliciality. Vector simpliciality requires uniqueness of $L^2(T)$2-boundary measures representing each functional $L^2(T)$3, whereas weak simpliciality requires uniqueness of $L^2(T)$4-boundary measures representing each evaluation $L^2(T)$5 (Kalenda et al., 22 Jan 2025).

The comparison is subtle. The two notions are, in general, incomparable; weak simpliciality is not affected by renorming the target space $L^2(T)$6, while vector simpliciality may be affected. When $L^2(T)$7 contains constants, vector simpliciality is strictly stronger and admits several characterizations analogous to the scalar case. The same work also studies Batty-inspired orderings on positive measures over $L^2(T)$8, gives a finer representation theorem using positive measures on $L^2(T)$9, and characterizes uniqueness in the metrizable, separable setting by vector simpliciality together with the condition that $\ell^2$0 is a simplexoid (Kalenda et al., 22 Jan 2025).

Taken together, these results show that function-vector methods in ordered and Banach-space settings are concerned not only with computation but with realization, representation, and uniqueness: abstract free objects, functionals, and operators are recast as concrete lattices or measure-theoretic objects.

3. Precomputed inversion and transform operators

In numerical analysis, a more algorithmic meaning appears in the $\ell^2$1-vector inversion method for one-dimensional analytic or tabulated nonlinear functions. Given sampled data $\ell^2$2 with $\ell^2$3, one sorts the $\ell^2$4-values to obtain $\ell^2$5, keeps the permutation vector $\ell^2$6 such that $\ell^2$7, and defines a straight $\ell^2$8-vector line

$\ell^2$9

using

$x\in\mathcal X$0

The $x\in\mathcal X$1-vector itself is the integer array

$x\in\mathcal X$2

with $x\in\mathcal X$3 and $x\in\mathcal X$4. For a query interval $x\in\mathcal X$5, the indices

$x\in\mathcal X$6

identify the relevant portion of the database without searching the full table. For inversion at target $x\in\mathcal X$7, the method defines a guaranteed search half-width $x\in\mathcal X$8, retrieves candidate indices, sorts the corresponding $x\in\mathcal X$9-values, clusters them by gaps larger than $b\in\mathcal Y$0, and uses the best local sample as a starting point for a classical root solver such as Newton–Raphson or bisection (Arnas et al., 2020).

The computational profile is explicit. Sorting the samples costs $b\in\mathcal Y$1, constructing the $b\in\mathcal Y$2-vector is $b\in\mathcal Y$3, memory is $b\in\mathcal Y$4, and per inversion the method is effectively $b\in\mathcal Y$5. In the Matlab test on a Gaussian integral with $b\in\mathcal Y$6 random inversions, Matlab’s fzero took $b\in\mathcal Y$7 at approximately $b\in\mathcal Y$8 iterations per inversion, the general $b\in\mathcal Y$9-vector plus Newton took $A:\mathcal X\to\mathcal Y$0 at approximately $A:\mathcal X\to\mathcal Y$1 iterations per inversion, and the optimal $A:\mathcal X\to\mathcal Y$2-vector variant took $A:\mathcal X\to\mathcal Y$3 with zero iterations. The paper explicitly places the $A:\mathcal X\to\mathcal Y$4-vector in the class of “function-vector” or “rank-support” methods that use pre-computed tables to speed up inversion (Arnas et al., 2020).

An “optimal” variant tailors the sample grid so that any target $A:\mathcal X\to\mathcal Y$5 returns exactly $A:\mathcal X\to\mathcal Y$6 points per root, for example $A:\mathcal X\to\mathcal Y$7 for Newton or $A:\mathcal X\to\mathcal Y$8 for bisection. This removes the small post-search filtering stage and directly supplies the desired number of starting points (Arnas et al., 2020).

A different transform-operator tradition appears in piecewise harmonic boundary-value problems on concentric spherical shells. There one defines linear integral operators $A:\mathcal X\to\mathcal Y$9 and $\mathcal H$00 with matrix-valued kernels $\mathcal H$01 so that the solution of the full problem is

$\mathcal H$02

These operators are derived by spherical-harmonic separation of variables, are linear, map boundary data to piecewise harmonic vector fields, and admit inverses in terms of the relevant trace operators under nondegeneracy hypotheses. In the unit disk, they specialize to explicit Fourier-series transforms for the third vector boundary-value problem and for a Dirichlet-interface problem (Yaremko et al., 2013).

The common feature of these two lines is the replacement of repeated direct solution by a vectorized surrogate object: an indexed range structure in one case, and integral or Fourier transform operators in the other.

4. Functions of matrices and multivectors

Function vector methods also include algorithms for evaluating functions on structured non-scalar arguments. For Clifford multivectors in two and three dimensions, a multivector in $\mathcal H$03 has the form

$\mathcal H$04

while in $\mathcal H$05 one writes

$\mathcal H$06

with $\mathcal H$07, $\mathcal H$08, and the even subalgebra $\mathcal H$09 isomorphic to the quaternions, while the central subalgebra $\mathcal H$10 isomorphic to the complex numbers. Writing $\mathcal H$11, where $\mathcal H$12 is the commuting part and $\mathcal H$13 is the non-commuting part satisfying $\mathcal H$14, one obtains the exponential formula

$\mathcal H$15

The same framework gives $\mathcal H$16, general powers $\mathcal H$17, the amplitude $\mathcal H$18, the inverse $\mathcal H$19, and a unified square-root formula valid in one, two, and three dimensions. One specific consequence is that a complex number raised to a vector power yields a quaternion (Chappell et al., 2014).

For matrix functions, a parallel rational-decomposition approach approximates

$\mathcal H$20

Starting from the power series $\mathcal H$21, one constructs a rational approximation

$\mathcal H$22

that matches the first $\mathcal H$23 Taylor coefficients through a Vandermonde-type system $\mathcal H$24, then rewrites the result in shifted-resolvent form with $\mathcal H$25 and $\mathcal H$26. Each processor solves one shifted linear system, and the outputs are linearly combined. The method comes with forward and backward error bounds, allows tuning of the coefficients to improve accuracy, stability, or round-off behavior, and admits hybrid polynomial-plus-fraction variants (Blanes, 2022).

The reported numerical results emphasize both accuracy and parallelism. For example, in the exponential-integrator setting in single precision, the paper gives

$\mathcal H$27

and states that cost measured in units of one $\mathcal H$28-vector product is reduced by up to a factor $\mathcal H$29 for order $\mathcal H$30 or $\mathcal H$31 for order $\mathcal H$32 in the parallel best-case. More generally, the approach is presented as suitable for parallel programming because the shifted solves are independent (Blanes, 2022).

These two developments are mathematically different, but both exemplify a characteristic strategy: replace direct evaluation of a complicated function on a structured argument by a decomposition into tractable vectorial components.

5. Directional estimation and vector optimization

Directional sampling provides another family of function vector methods. For a real-valued function $\mathcal H$33, the directional derivative in direction $\mathcal H$34 is approximated either by the central finite difference

$\mathcal H$35

or by the complex-step formula

$\mathcal H$36

The multi-axis method chooses an orthonormal basis $\mathcal H$37 and uses

$\mathcal H$38

with possible averaging over rotated bases $\mathcal H$39. The multi-vector method draws unit vectors uniformly on the sphere and forms

$\mathcal H$40

The analysis states that both one-dimensional approximations have $\mathcal H$41 truncation error; multi-axis can cancel the leading $\mathcal H$42 bias by symmetry over a full orthonormal basis, while multi-vector retains $\mathcal H$43 bias but has variance decaying like $\mathcal H$44. The complex-step method avoids subtraction error and, in the authors’ qualitative tests, the complex-step multi-axis and complex-step multi-vector variants were rated “Very Good” (Akleman et al., 2023).

A separate optimization literature studies vector-valued objectives $\mathcal H$45 ordered by a closed, convex, pointed cone $\mathcal H$46. The majorization-minimization framework replaces $\mathcal H$47 by a surrogate $\mathcal H$48 and computes a direction through

$\mathcal H$49

where $\mathcal H$50 is a chosen base of the dual cone. Under mild assumptions, the framework yields global subsequential stationarity; under strong $\mathcal H$51-convexity and $\mathcal H$52-smoothness, it yields a linear rate. Classical steepest descent without line search, steepest descent with Armijo line search, improved steepest descent, and Barzilai–Borwein descent all arise from different choices of surrogate $\mathcal H$53 and base $\mathcal H$54 (Chen et al., 2024).

For polyhedral cones $\mathcal H$55, the Barzilai–Borwein descent method for vector optimization problems (BBDVO) introduces a BB-style diagonal weighting $\mathcal H$56, a reweighted base $\mathcal H$57, an equivalent dual quadratic program over the simplex, and an Armijo line search. The paper’s interpretation is that slow convergence of steepest descent is primarily due to the gap between surrogate and objective, and that tightening the surrogate is equivalent to choosing an appropriate base of the dual cone in the direction-finding subproblem (Chen et al., 2024).

Here the phrase “function vector methods” no longer refers to a fixed data structure. Instead, it refers to procedures that infer vector information about a function—either its gradient from directional samples or its descent geometry from cone-based surrogate models.

6. Distributed and secure computation of vector functions

In network information theory, the object of study is often a vector function itself. One recent model considers a directed acyclic multigraph $\mathcal H$58 with multiple distributed sources, a distinguished sink $\mathcal H$59, and source messages $\mathcal H$60. The sink wishes to compute a vector-linear target

$\mathcal H$61

while keeping a vector-linear security function

$\mathcal H$62

perfectly secret from an eavesdropper observing one wiretap set from a prescribed collection $\mathcal H$63. The secure computing capacity is defined as the supremum of rates $\mathcal H$64 achievable with zero-error decodability and $\mathcal H$65 for every $\mathcal H$66 (Xu et al., 7 Feb 2026).

The paper establishes two cut-based upper bounds for arbitrary topologies and arbitrary vector-linear target and security functions. Both bounds depend on a quantity $\mathcal H$67 that measures the dimension of the overlap between spans induced by the target matrix $\mathcal H$68, the cut partition, and the security matrix $\mathcal H$69. For the sum function over a finite field with $\mathcal H$70, the first bound recovers the known cut-set bound. For lower bounds, when the target is the sum, a non-secure linear code is transformed into a secure one by a block-diagonal mixing matrix $\mathcal H$71, and a counting argument shows that such a $\mathcal H$72 can be chosen provided $\mathcal H$73, where $\mathcal H$74. For a class of three-layer tree networks, the work also characterizes the rank and span-intersection conditions on the global encoding matrix needed to obtain a secure vector linear network code (Xu et al., 7 Feb 2026).

A related but physically different setting is MIMO digital over-the-air computation. VecComp generalizes the scalar ChannelComp framework to vector function computation over a $\mathcal H$75-user uplink MIMO multiple-access channel. Each transmitter has $\mathcal H$76 antennas, the central processor has $\mathcal H$77 antennas, and after random transmit beamforming and receive combining the post-beamforming vector is

$\mathcal H$78

Under massive-MIMO zero-forcing, one has asymptotically $\mathcal H$79, after which a digital map $\mathcal H$80 recovers the desired vector function. The design treats each output dimension as a separate sub-channel: each user computes a modulation vector $\mathcal H$81 so that the superposition $\mathcal H$82 uniquely encodes the range of the target function, or maximizes minimum distance under power constraints via a small SDP per output dimension (Razavikia et al., 4 Nov 2025).

VecComp’s theoretical guarantee is a non-asymptotic upper bound on the mean squared error. Writing $\mathcal H$83, $\mathcal H$84, and $\mathcal H$85, the paper states that for any $\mathcal H$86 and $\mathcal H$87, with probability at least $\mathcal H$88,

$\mathcal H$89

provided

$\mathcal H$90

where $\mathcal H$91 and $\mathcal H$92. The framework’s complexity grows linearly in the vector dimension $\mathcal H$93: modulation design costs $\mathcal H$94, and decoding costs $\mathcal H$95, where $\mathcal H$96. The numerical results report, among other findings, up to $\mathcal H$97 normalized-MSE reduction as $\mathcal H$98 increases from $\mathcal H$99 to $$\langle f,g\rangle=\int_T f(t)\,\overline{g(t)}\,dt,$$00 for $$\langle f,g\rangle=\int_T f(t)\,\overline{g(t)}\,dt,$$01, $$\langle f,g\rangle=\int_T f(t)\,\overline{g(t)}\,dt,$$02, $$\langle f,g\rangle=\int_T f(t)\,\overline{g(t)}\,dt,$$03, and $$\langle f,g\rangle=\int_T f(t)\,\overline{g(t)}\,dt,$$04 up to $$\langle f,g\rangle=\int_T f(t)\,\overline{g(t)}\,dt,$$05, as well as up to $$\langle f,g\rangle=\int_T f(t)\,\overline{g(t)}\,dt,$$06 NMSE gain over analog-MIMO OAC and wideband-MIMO baselines for several functions at low SNR (Razavikia et al., 4 Nov 2025).

These distributed frameworks treat vector-valued function computation itself as the primary communication primitive. A plausible implication is that, in this branch of the literature, function vector methods shift from representation or inversion toward code design, robustness, secrecy, and physical-layer implementation.