2023/02/20 by Carl Leake, Leake, Carl
Computer Science · #Analysis of PDEs (math.AP) #Distributed and Parallel Computing Systems #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.2302.10223
openalex publication_date 2023/02/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The Theory of Functional Connections (TFC) is most often used for constraints over the field of real numbers. However, previous works have shown that it actually extends to arbitrary fields. The evidence for these claims is restricting oneself to the field of real numbers is unnecessary because all of the theorems, proofs, etc. for TFC apply as written to fields in general. Here, that notion is taken a step further, as fields themselves are unnecessarily restrictive. The theorems, proofs, etc. of TFC apply to vector spaces, not just fields. Moreover, the inputs of the functions/constraints do not even need to be restricted to vector spaces; they can quite literally be anything. In this note, the author shows the more general inputs/outputs of the various symbols that comprise TFC. Examples with accompanying, open-access Python code are included to aid the reader's understanding.