QR Factorization Matrix Update for Reduced Computation Time

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Processing data involving large condition numbers and computationally intensive calculations can be time-consuming and error-prone, necessitating more efficient methods for reusing previously generated calculations.

Innovation Solution

The method involves receiving and updating data sets to reuse intermediate data from previous calculations, specifically using the Householder reflection algorithm for QR factorization, allowing for efficient updating of matrices by adding, removing, or modifying rows and columns, thereby reducing the need for recomputing entire solutions.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If traditional matrix factorization methods are used to process data with large condition numbers, then computational accuracy is maintained, but processing time increases significantly

Engineering Contradiction:
Improvecomputational accuracyVSAvoidprocessing time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent performs QR factorization on the initial matrix A before adding new rows, storing the intermediate results (Q and R matrices). When new data is added, only the necessary updates are computed rather than performing complete factorization again, significantly reducing processing time while maintaining accuracy

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent divides the matrix update process into segments: initial complete QR factorization, then incremental updates when rows are added. This segmentation allows the computationally intensive part to be done once, with lighter update operations subsequent to it

Inventive Principle:
Principle #1Segmentation

2Measurement precision

If complete matrix factorization is performed each time data is updated, then solution accuracy is ensured, but computational efficiency decreases

Engineering Contradiction:
Improvesolution accuracyVSAvoidcomputational efficiency
Core Design Contradiction:
Measurement precisionVSProductivity

Solution Approach 1:

The patent maintains continuous computational efficiency by updating the QR factorization incrementally as new rows are added, rather than discontinuously recomputing the entire factorization. The intermediate Q and R matrices are preserved and updated, creating a continuous efficient processing stream

Inventive Principle:
Principle #20Continuity of useful action

Solution Approach 2:

The initial QR factorization is performed in advance before data updates occur. This preliminary computation stores intermediate results that can be efficiently updated later, avoiding the need to repeat the expensive complete factorization process

Inventive Principle:
Principle #10Preliminary action

3Productivity

If intermediate calculation results are reused when updating matrices, then processing speed increases, but system complexity increases

Engineering Contradiction:
Improveprocessing speedVSAvoidsystem complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent segments the matrix into an initial portion (for which complete QR factorization is performed) and an incremental portion (newly added rows). This segmentation allows reuse of intermediate results from the initial factorization while managing the complexity of updates in a structured way

Inventive Principle:
Principle #1Segmentation

Data Source

PatentUS10262021B2Methods and systems for processing data using QR factorization
Publication Date: 2019.04.16 QLIK TECH INTERNATIONAL AB
  • US10262021B2 patent drawing
  • US10262021B2 patent drawing
  • US10262021B2 patent drawing

AI summary

Methods and systems for processing data are disclosed. In an aspect, a first set of data can be received. A first set of intermediate data can be determined based on the first set of data. A basis for a factorization can be determined based on the first set of intermediate data. A second set of data can be received. The basis for the factorization can be updated based on the second set of data. The factorization can be performed based on the updated basis for the factorization.