Cited by 11Matrix Theory and AlgorithmsRings, Modules, and AlgebrasAdvanced Combinatorial Mathematics

The DOI matches its Crossref record.

Solution theory for complete bilinear systems of equations

Johnson, Charles R., Link, Joshua A.·2009·Numerical Linear Algebra with Applications

Abstract

For A1,…, Am∈Mp, q(F) and g∈Fm, any system of equations of the form yTAix=gi, i=1,…, m, with y varying over Fp and x over Fq is called bilinear. Given here are some general observations about bilinear systems, a complete solution theory for complete systems (m=pq, A1,…, Am linearly independent) and implications of the complete theory for general (incomplete, m<pq) systems. Copyright © 2009 John Wiley & Sons, Ltd.

Overview

Integrity signals

Registry

Crossref · 10.1002/nla.676

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

No references could be resolved yet.

Research works printed but not linked: 3

  1. 10.1016/j.dam.2007.08.040 · DOI
  2. 10.1016/S0024-3795(00)00071-9 · DOI
  3. Horn R, 1990, Topics in Matrix Analysis

Cited by

Sorted by citations

See all 11

Metadata

Authors
Johnson, C. R., & Link, J. A.
Affiliations
  • William & Mary (US)
  • Indiana University Bloomington (US)
Corresponding author
Link, Joshua A.
Venue
Numerical Linear Algebra with Applications
Publisher
Wiley
Published
2009-10-23
Volume
16
Issue
11-12
Pages
929-934
ISSN
  • 1070-5325 (ISSN-L)
  • 1099-1506
OpenAlex
W2152515394
Cited by
11
References
0
Citations by year
2023: 2 · 2021: 3 · 2015: 1 · 2014: 1 · 2013: 2 · 2012: 1
FWCI
0.65
Type
journal article
Language
en
Open access
closed
Locations
Numerical Linear Algebra with Applications (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
  • Physical Sciences › Mathematics › Algebra and Number Theory › Rings, Modules, and Algebras
  • Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Advanced Combinatorial Mathematics
Keywords
bilinear systems, solution theory, finite fields, matrix equations

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Solution theory for complete bilinear systems of equations. https://app.cochat.ai/papers/10.1002/nla.676
The paper
Johnson, C. R., & Link, J. A. (2009). Solution theory for complete bilinear systems of equations. Numerical Linear Algebra with Applications. https://doi.org/10.1002/nla.676