Least Squares Approximation of Matrices by Additive and Multiplicative Models
矩阵的加性与乘性模型最小二乘逼近AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要讨论通用矩阵逼近、主成分及双向表拟合,未明确建立宏观或金融因子模型,故不据相似形式分类。
反馈分类问题矩阵的加性与乘性模型最小二乘逼近AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Summary Reduced rank approximation of matrices by Householder–Young methods is shown to be equivalent to fitting of a bilinear (multiplicative) model and to projection onto an optimally chosen subspace. The relation to linear approximation is made evident. Least squares fitting of a mixed linear (additive) and bilinear (multiplicative) model is proved to be a two-stage process: (1) fit the linear part of the model, then take residuals, and (2) fit the bilinear part to the residuals. Extensions of this result are given as well as some results on distributions of residuals and tests against alternatives of given rank. Statistical applications are shown in principal component analysis, in biplot graphical display and in fitting additive or Mandel-type models to two-way tables.